Performance of linear-space search algorithms

Artificial Intelligence

Volumn 79, Issue 2, 1995, Pages 241-292

  Zhang, Weixiong ^a   Korf, Richard E ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; ITERATIVE METHODS; PERFORMANCE; PROBLEM SOLVING; RANDOM PROCESSES; RECURSIVE FUNCTIONS; TREES (MATHEMATICS);

DEPTH FIRST BRANCH BOUND; ITERATIVE DEEPENING; LINEAR SPACE; RECURSIVE BEST FIRST SEARCH; SEARCH ALGORITHMS;

ALGORITHMS;

EID: 0029539913     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/0004-3702(94)00047-6     Document Type: Article

References (60)

1. Branch and bound methods
2. Heuristic search in restricted memory
3. Where the really hard problems are
4. Experimental results on the crossover point in satisfiability problems
5. A probabilistic analysis of branch-and-bound search
6. ∗
7. A note on two problems in connexion with graphs
8. On a linear diophantine problem of frobenius
9. Analysis of the alpha-beta pruning algorithm
10. Performance measurement and analysis of certain search algorithms
11. Iterative broadening
12. Postulates for subadditive processes
13. A formal basis for the heuristic determination of minimum cost paths
14. Phase transitions in artificial intelligence systems
15. ∗
16. Enumerative Approaches to Combinatorial Optimization—Part I
17. Searching for an optimal path in a tree with random costs
18. The first birth problem for an age-dependent branching process
19. Depth-first iterative-deepening: An optimal admissible tree search
20. Real-time heuristic search
21. Linear-space best-first search
22. Search branch-and-bound
23. A general branch-and-bound formulation for and/or graph and game tree search
24. Systematic and nonsystematic search strategies
25. Evidence for a satisfiability threshold for random 3CNF formulas
26. Branch-and-bound methods a survey
27. ∗ on trees and graphs
28. Probabilistic analysis of tree search
29. An expected-cost analysis of backtracking and non-backtracking algorithms
30. Hard and easy distributions of SAT problems
31. ∗
32. ∗
33. Branching factor
34. Practical and theoretical considerations in heuristic search algorithms
35. Search rearrangement backtracking and polynomial average time
36. Finding a shortest solution for the n × n extension of the 15-puzzle is intractable
37. Efficient memory-bounded search methods
38. Reducing reexpansions in iterative-deepening search by controlling cutoff bounds
39. Fast recursive formulations for best-first search that allow controlled use of memory
40. Random trees and the analysis of branch and bound procedures
41. The average complexity of depth-first search with backtracking and cutoff
42. Pruning duplicate nodes in depth-first search
43. Depth-first vs best-first search
44. ∗ search with dynamic control
45. Stochastic modeling of branch-and-bound algorithms with best-first search
46. Extending deep structure
47. Truncated branch-and-bound: a case study on the asymmetric TSP
48. Analyses of linear-space search algorithms and applications
49. An average-case analysis of branch-and-bound with applications: summary of results
50. Depth-first vs. best-first search: New results
51. Epsilon-transformation: Exploiting phase transitions to solve combinatorial optimization problems
52. Epsilon-transformation: exploiting phase transitions to solve combinatorial optimization problems—initial results