- Developmental Dyslexia: Disorder or Specialization in Exploration?Helen Taylor & Martin David Vestergaard - 2022 - Frontiers in Psychology 13:889245.details
|
|
Duality in permutation state spaces and the dual search algorithm.Uzi Zahavi, Ariel Felner, Robert C. Holte & Jonathan Schaeffer - 2008 - Artificial Intelligence 172 (4-5):514-540.details
|
|
Refinements to depth-first iterative-deepening search in automatic theorem proving.Xumin Nie & David A. Plaisted - 1989 - Artificial Intelligence 41 (2):223-235.details
|
|
A high-performance explanation-based learning algorithm.Alberto Segre & Charles Elkan - 1994 - Artificial Intelligence 69 (1-2):1-50.details
|
|
Non-Horn clause logic programming.Xumin Nie - 1997 - Artificial Intelligence 92 (1-2):243-258.details
|
|
Quantitatively relating abstractness to the accuracy of admissible heuristics.Armand Prieditis & Robert Davis - 1995 - Artificial Intelligence 74 (1):165-175.details
|
|
BIDA∗: an improved perimeter search algorithm.Giovanni Manzini - 1995 - Artificial Intelligence 75 (2):347-360.details
|
|
Algorithm for optimal winner determination in combinatorial auctions.Tuomas Sandholm - 2002 - Artificial Intelligence 135 (1-2):1-54.details
|
|
A Hybrid of Search Efficiency Mechanisms: Pruning Learning Heuristic Hybrid.Reza Zamani - 2005 - Journal of Intelligent Systems 14 (4):265-288.details
|
|
An efficient relational deductive system for propositional non-classical logics.Andrea Formisano & Marianna Nicolosi-Asmundo - 2006 - Journal of Applied Non-Classical Logics 16 (3-4):367-408.details
|
|
Learning heuristic functions for large state spaces.Shahab Jabbari Arfaee, Sandra Zilles & Robert C. Holte - 2011 - Artificial Intelligence 175 (16-17):2075-2098.details
|
|
Performance of linear-space search algorithms.Weixiong Zhang & Richard E. Korf - 1995 - Artificial Intelligence 79 (2):241-292.details
|
|
Dynamically improved bounds bidirectional search.E. C. Sewell & S. H. Jacobson - 2021 - Artificial Intelligence 291 (C):103405.details
|
|
Batch repair actions for automated troubleshooting.Hilla Shinitzky & Roni Stern - 2020 - Artificial Intelligence 283 (C):103260.details
|
|
Principles of metareasoning.Stuart Russell & Eric Wefald - 1991 - Artificial Intelligence 49 (1-3):361-395.details
|
|
Speeding up problem solving by abstraction: a graph oriented approach.R. C. Holte, T. Mkadmi, R. M. Zimmer & A. J. MacDonald - 1996 - Artificial Intelligence 85 (1-2):321-361.details
|
|
Best-first fixed-depth minimax algorithms.Aske Plaat, Jonathan Schaeffer, Wim Pijls & Arie de Bruin - 1996 - Artificial Intelligence 87 (1-2):255-293.details
|
|
When is Psychology Research Useful in Artificial Intelligence? A Case for Reducing Computational Complexity in Problem Solving.Sébastien Hélie & Zygmunt Pizlo - 2022 - Topics in Cognitive Science 14 (4):687-701.details
|
|
Optimal Sokoban solving using pattern databases with specific domain knowledge.André G. Pereira, Marcus Ritt & Luciana S. Buriol - 2015 - Artificial Intelligence 227 (C):52-70.details
|
|
Computational protein design as an optimization problem.David Allouche, Isabelle André, Sophie Barbe, Jessica Davies, Simon de Givry, George Katsirelos, Barry O'Sullivan, Steve Prestwich, Thomas Schiex & Seydou Traoré - 2014 - Artificial Intelligence 212 (C):59-79.details
|
|
Conflict-based search for optimal multi-agent pathfinding.Guni Sharon, Roni Stern, Ariel Felner & Nathan R. Sturtevant - 2015 - Artificial Intelligence 219 (C):40-66.details
|
|
Adopt: asynchronous distributed constraint optimization with quality guarantees.Pragnesh Jay Modi, Wei-Min Shen, Milind Tambe & Makoto Yokoo - 2005 - Artificial Intelligence 161 (1-2):149-180.details
|
|
Planning as search: A quantitative approach.Richard E. Korf - 1987 - Artificial Intelligence 33 (1):65-88.details
|
|
Heuristic search in restricted memory.P. P. Chakrabarti, S. Ghose, A. Acharya & S. C. de Sarkar - 1989 - Artificial Intelligence 41 (2):197-221.details
|
|
Iterative broadening.Matthew L. Ginsberg & William D. Harvey - 1992 - Artificial Intelligence 55 (2-3):367-383.details
|
|
A SIMD approach to parallel heuristic search.Ambuj Mahanti & Charles J. Daniels - 1993 - Artificial Intelligence 60 (2):243-282.details
|
|
Iterative state-space reduction for flexible computation.Weixiong Zhang - 2001 - Artificial Intelligence 126 (1-2):109-138.details
|
|
Games, computers, and artificial intelligence.Jonathan Schaeffer & H. Jaap van den Herik - 2002 - Artificial Intelligence 134 (1-2):1-7.details
|
|
Planning as heuristic search.Blai Bonet & Héctor Geffner - 2001 - Artificial Intelligence 129 (1-2):5-33.details
|
|
Disjoint pattern database heuristics.Richard E. Korf & Ariel Felner - 2002 - Artificial Intelligence 134 (1-2):9-22.details
|
|
Time complexity of iterative-deepening-A∗.Richard E. Korf, Michael Reid & Stefan Edelkamp - 2001 - Artificial Intelligence 129 (1-2):199-218.details
|
|
Depth-first heuristic search on a SIMD machine.Curt Powley, Chris Ferguson & Richard E. Korf - 1993 - Artificial Intelligence 60 (2):199-242.details
|
|
Controlling the learning process of real-time heuristic search.Masashi Shimbo & Toru Ishida - 2003 - Artificial Intelligence 146 (1):1-41.details
|
|
On searching explanatory argumentation graphs.Régis Riveret - 2020 - Journal of Applied Non-Classical Logics 30 (2):123-192.details
|
|
Heuristic evaluation functions in artificial intelligence search algorithms.Richard E. Korf - 1995 - Minds and Machines 5 (4):489-498.details
|
|
Probably bounded suboptimal heuristic search.Roni Stern, Gal Dreiman & Richard Valenzano - 2019 - Artificial Intelligence 267 (C):39-57.details
|
|
Anytime search in dynamic graphs.Maxim Likhachev, Dave Ferguson, Geoff Gordon, Anthony Stentz & Sebastian Thrun - 2008 - Artificial Intelligence 172 (14):1613-1643.details
|
|
Linear-space best-first search.Richard E. Korf - 1993 - Artificial Intelligence 62 (1):41-78.details
|
|
Probabilistic conflicts in a search algorithm for estimating posterior probabilities in Bayesian networks.David Poole - 1996 - Artificial Intelligence 88 (1-2):69-100.details
|
|
Optimal composition of real-time systems.Shlomo Zilberstein & Stuart Russell - 1996 - Artificial Intelligence 82 (1-2):181-213.details
|
|
Potential-based bounded-cost search and Anytime Non-Parametric A ⁎.Roni Stern, Ariel Felner, Jur van den Berg, Rami Puzis, Rajat Shah & Ken Goldberg - 2014 - Artificial Intelligence 214 (C):1-25.details
|
|
Maximizing over multiple pattern databases speeds up heuristic search.Robert C. Holte, Ariel Felner, Jack Newton, Ram Meshulam & David Furcy - 2006 - Artificial Intelligence 170 (16-17):1123-1136.details
|
|
Real-time heuristic search.Richard E. Korf - 1990 - Artificial Intelligence 42 (2-3):189-211.details
|
|
Pruning algorithms for multi-model adversary search.David Carmel & Shaul Markovitch - 1998 - Artificial Intelligence 99 (2):325-355.details
|
|
Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces.Levi H. S. Lelis, Roni Stern, Shahab Jabbari Arfaee, Sandra Zilles, Ariel Felner & Robert C. Holte - 2016 - Artificial Intelligence 230 (C):51-73.details
|
|
Breadth-first heuristic search.Rong Zhou & Eric A. Hansen - 2006 - Artificial Intelligence 170 (4-5):385-408.details
|
|
Reducing reexpansions in iterative-deepening search by controlling cutoff bounds.U. K. Sarkar, P. P. Chakrabarti, S. Ghose & S. C. De Sarkar - 1991 - Artificial Intelligence 50 (2):207-221.details
|
|
Symbolic perimeter abstraction heuristics for cost-optimal planning.Álvaro Torralba, Carlos Linares López & Daniel Borrajo - 2018 - Artificial Intelligence 259 (C):1-31.details
|
|
Minimal proof search for modal logic k model checking.Abdallah Saffidine - 2012 - In Luis Farinas del Cerro, Andreas Herzig & Jerome Mengin (eds.), Logics in Artificial Intelligence. Springer. pp. 346--358.details
|
|
Computer Go: An AI oriented survey.Bruno Bouzy & Tristan Cazenave - 2001 - Artificial Intelligence 132 (1):39-103.details
|
|