General Information
NameProf. Roni Stern
DepartmentDepartment of Software and Information Systems Engineering
Emailroni.stern@gmail.com
Personal Web SitePersonal Web Site
Academic RankProfessor


Journal Articles

 
[1] Stern R., Potential-based bounded-cost search and Anytime Non-Parametric A*, Artif. Intell. (Netherlands), 214, 1 - 25, (2014).
[2] Stern R., Model-based diagnosis techniques for Internet delay diagnosis with dynamic routing, Appl. Intell. Int. J. Artif. Intell. Neural Netw. Complex Probl.-Solving Technol. (USA), 41, 1, 167 - 83, (2014).
[3] Stern R., A Novel SAT-Based Approach to Model Based Diagnosis, J. Artif. Intell. Res. (USA), 51, 377 - 411, (2014).
[4] Stern R., Enhanced Partial Expansion A*, J. Artif. Intell. Res. (USA), 50, 141 - 87, (2014).
[5] Stern R., Predicting optimal solution cost with conditional probabilities: predicting optimal solution cost, Ann. Math. Artif. Intell. (Netherlands), 72, 3-4, 267 - 95, (2014).
[6] Stern R., Bandit Algorithms for Social Network Queries, 2013 International Conference on Social Computing (SocialCom), 148 - 53, (2013).
[7] Stern R., Finding patterns in an unknown graph, AI Commun. (Netherlands), 25, 3, 229--256, (2012).
[8] Stern R., Who is going to win the next Association for the Advancement of Artificial Intelligence Fellowship Award? Evaluating researchers by mining bibliographic data, J. Am. Soc. Inf. Sci. Technol. (USA), 62, 12, 2456 - 70, (2011).
[9] Pomeransky Alex, Stern R., Rosenchein Jefferey, Searching for close alternative plans, , 14, 3, 211-237, (2007).
[10] Stern R., PHA*: Finding the shortest path with A* in an unknown physical environment, Journal of Artificial Intelligence Research, 21, 631 - 670, (2004).

Show All
   

To the top

Conference Proceedings

 
[1] Sturtevant Nathan, Stern R., Meta-Agent Conflict-Based Search For Optimal Multi-Agent Path Finding. SOCS, SoCS, (2012).
[2] Beja Tal, Sturtevant Nathan, Schaeffer Jonathan, Stern R., Holte Robert, Partial-Expansion A* with Selective Node Generation. AAAI, (2012).
[3] Sturtevant Nathan, Stern R., Conflict-Based Search For Optimal Multi-Agent Path Finding. AAAI, (2012).
[4] Stern R., Potential search: a bounded-cost search algorithm, Intenational Conferences on Automated planing and scheduling (ICAPS), (2011).
[5] Stern R., Pruning Techniques for the Increasing Cost Tree Search for Optimal Multi-agent Pathfinding. SOCS, (2011).
[6] Stern R., The Increasing Cost Tree Search for Optimal Multi-Agent Pathfinding. IJCAI, (2011).
[7] Stern R., Kulberis Tamar, Holte Robert, Using Lookaheads with Optimal Best-First Search, AAAI, (2010).
[8] Stern R., Searching for a k-clique in unknown graphs, SoCS, (2010).
[9] Kraus Sarit, Stern R., PHA*: performing A* in unknown physical environments, AAMAS, (2002).

Show All
   

To the top

Technical Report

 
[1] Stern R., (22990/2010), MBD runtime analysis for NDDP, (2010).

Show All
   

To the top

White paper

 
[1] Stern R., MeiravCV, (2012).
[2] Stern R., RoniCV, (2012).

Show All
   

To the top

Poster

 
[1] Stern R., Searching for a k-Clique in Unknown Graphs, (2010).
[2] Stern R., Potential Search: a greedy anytime heuristic search, (2010).
[3] Stern R., MBD Techniques for Internet Delay Diagnosis, (2010).

Show All