Generalized best-first search strategies and the optimality of A*
Journal of the ACM (JACM)
Depth-first iterative-deepening: an optimal admissible tree search
Artificial Intelligence
Heuristic search in restricted memory (research note)
Artificial Intelligence
Single-Agent Parallel Window Search
IEEE Transactions on Pattern Analysis and Machine Intelligence
Efficient memory-bounded search methods
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Linear-space best-first search
Artificial Intelligence
Improving search through diversity
AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
PRA*: massively parallel heuristic search
Journal of Parallel and Distributed Computing
Artificial Intelligence
A complete anytime algorithm for number partitioning
Artificial Intelligence
Disjoint pattern database heuristics
Artificial Intelligence - Chips challenging champions: games, computers and Artificial Intelligence
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On the Efficiency of Parallel Backtracking
IEEE Transactions on Parallel and Distributed Systems
Domain-Dependent Single-Agent Search Enhancements
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
The Differencing Method of Set Partitioning
The Differencing Method of Set Partitioning
Performance measurement and analysis of certain search algorithms.
Performance measurement and analysis of certain search algorithms.
Interleaved depth-first search
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Depth-bounded discrepancy search
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Improved limited discrepancy search
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Software controlled memory layout reorganization for irregular array access patterns
CASES '07 Proceedings of the 2007 international conference on Compilers, architecture, and synthesis for embedded systems
Compiler driven data layout optimization for regular/irregular array access patterns
Proceedings of the 2008 ACM SIGPLAN-SIGBED conference on Languages, compilers, and tools for embedded systems
Distributed Extended Beam Search for Quantitative Model Checking
Model Checking and Artificial Intelligence
ODE: Ontology-assisted data extraction
ACM Transactions on Database Systems (TODS)
Weighted A∗ search -- unifying view and application
Artificial Intelligence
PHA*: finding the shortest path with A* in an unknown physical environment
Journal of Artificial Intelligence Research
Limited discrepancy beam search
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Scaling up WA* with commitment and diversity
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Adaptive scratch pad memory management for dynamic behavior of multimedia applications
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Best-first heuristic search for multi-core machines
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Best-first heuristic search for multicore machines
Journal of Artificial Intelligence Research
Parallel suboptimal heuristic search for finding a w-admissible solution. performance analysis
ICANCM'11/ICDCC'11 Proceedings of the 2011 international conference on applied, numerical and computational mathematics, and Proceedings of the 2011 international conference on Computers, digital communications and computing
Efficient search for transformation-based inference
ACL '12 Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Long Papers - Volume 1
Understanding query interfaces by statistical parsing
ACM Transactions on the Web (TWEB)
Hi-index | 0.00 |
We introduce a new algorithm, K-best-first search (KBFS), which is a generalization of the well known best-first search (BFS). In KBFS, each iteration simultaneously expands the K best nodes from the open-list (rather than just the best as in BFS). We claim that KBFS outperforms BFS in domains where the heuristic function has large errors in estimation of the real distance to the goal state or does not predict dead-ends in the search tree. We present empirical results that confirm this claim and show that KBFS outperforms BFS by a factor of 15 on random trees with dead-ends, and by a factor of 2 and 7 on the Fifteen and Twenty-Four tile puzzles, respectively. KBFS also finds better solutions than BFS and hill-climbing for the number partitioning problem. KBFS is only appropriate for finding approximate solutions with inadmissible heuristic functions.