On the complexity of search algorithms (original) (raw)
Related papers
Position Paper: Incremental Search Algorithms Considered Poorly Understood
Proceedings of the International Symposium on Combinatorial Search
Artificial Intelligence, 2016
Performance of Linear-Space Search Algorithms
Artificial Intelligence, 1995
Generalized best-first search strategies and the optimality of A
Journal of The ACM - JACM, 1985
AI 03 Solving Problems by Searching
Recursive Best-First Search with Bounded Overhead
Proceedings of the ... AAAI Conference on Artificial Intelligence, 2015
Assessing the Finite-Time Performance of Local Search Algorithms
2001
Combining variants of iterative flattening search
Engineering Applications of Artificial Intelligence, 2008
Best-first utility-guided search
2007
Efficient Memory-Bounded Search Methods.
The B∗ tree search algorithm—New results
Artificial Intelligence, 1982
Potential search: a bounded-cost search algorithm
Proceedings of the Twenty-First International …, 2011
Operations Research, 2002
Reasons for the effects of bounded look-ahead search
IEEE Transactions on Systems, Man, and Cybernetics, 1992
Nicolas Prcovic, Bertrand Neveu
An experimental analysis of the B* tree search algorithm
2018
Using distance estimates in heuristic search: A re-evaluation
2009
Extended abstract: Learning search strategies
New Results in Bounded-Suboptimal Search
Proceedings of the ... AAAI Conference on Artificial Intelligence, 2022
Depth-First Branch-and-Bound versus Local Search: A Case Study
2000
Artificial Intelligence, 1983
Improving search efficiency using possible subgoals
Mathematical and Computer Modelling, 1995
Potential-based bounded-cost search and Anytime Non-Parametric A⁎
Artificial Intelligence, 2014
Truncated Incremental Search: Faster Replanning by Exploiting Suboptimality
Proceedings of the AAAI Conference on Artificial Intelligence
An elementary approach to optimal discrete-time search strategies
Sequential Analysis, 2017
An Algorithm for Analysis the Time Complexity for Iterated Local Search (ILS
1997
Techniques for Improving the Efficiency of Heuristic Search
1993
Search strategies for an anytime usage of the branch and prune algorithm
2009
Better Parameter-Free Anytime Search by Minimizing Time Between Solutions
2012
Complexity Analysis of Admissible Heuristic Search
1998
Worst Improvement Based Iterated Local Search
Lecture Notes in Computer Science, 2018