Depth-first iterative-deepening: An optimal admissible tree search
From MaRDI portal
Publication:1062761
DOI10.1016/0004-3702(85)90084-0zbMath0573.68030OpenAlexW2150470619WikidataQ56269613 ScholiaQ56269613MaRDI QIDQ1062761
Publication date: 1985
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0004-3702(85)90084-0
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Artificial intelligence (68T99)
Related Items (only showing first 100 items - show all)
IDNAF Prolog ⋮ Iterative versionspaces ⋮ Agent searching in a tree and the optimality of iterative deepening ⋮ Controlled integration of the cut rule into connection tableau calculi ⋮ A real-time algorithm for the \((n^{2}-1)\)-puzzle ⋮ Iterative deepening multiobjective \(A^{*}\) ⋮ Perimeter search in restricted memory ⋮ An upper bound on the time complexity of iterative-deepening-\(A^*\) ⋮ A new variant of the \(A^*\)-algorithm which closes a node at most once. ⋮ The impact of search heuristics on heavy-tailed behaviour ⋮ Searching minimax game trees under memory space constraint ⋮ Real-time heuristic search ⋮ Symbolic perimeter abstraction heuristics for cost-optimal planning ⋮ Duality in permutation state spaces and the dual search algorithm ⋮ Anytime search in dynamic graphs ⋮ Near-optimal online control of dynamic discrete-event systems ⋮ On the abstraction method for the container relocation problem ⋮ An exact algorithm for the blocks relocation problem with new lower bounds ⋮ Intelligent transportation systems -- Enabling technologies ⋮ Improving search efficiency using possible subgoals ⋮ A Prolog technology theorem prover: Implementation by an extended Prolog compiler ⋮ Parallel depth first search. I: Implementation ⋮ Parallel depth first search. II: Analysis ⋮ Depth-first heuristic search for the job shop scheduling problem ⋮ Improving the robustness of EPS to solve the TSP ⋮ Benefits of using multivalued functions for minimaxing ⋮ Pruning algorithms for multi-model adversary search ⋮ Probabilistic conflicts in a search algorithm for estimating posterior probabilities in Bayesian networks ⋮ Optimal Sokoban solving using pattern databases with specific domain knowledge ⋮ Non-Horn clause logic programming ⋮ Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces ⋮ Learning heuristic functions for large state spaces ⋮ Maximizing revenue with allocation of multiple advertisements on a Web banner ⋮ Resource access control for dynamic priority distributed real-time systems ⋮ Tree search and quantum computation ⋮ The \((n^ 2-1)\)-puzzle and related relocation problems ⋮ Inconsistent heuristics in theory and practice ⋮ Increasing threshold search for best-valued agents ⋮ Extended beam search for non-exhaustive state space analysis ⋮ Information capture and reuse strategies in Monte Carlo Tree Search, with applications to games of hidden information ⋮ Computational protein design as an optimization problem ⋮ Acceleration strategies for the weight constrained shortest path problem with replenishment ⋮ Towards a unified model of search in theorem-proving: subgoal-reduction strategies ⋮ Nonlinear and temporal multiscale dynamics of gene regulatory networks: a qualitative simulator ⋮ Maximizing over multiple pattern databases speeds up heuristic search ⋮ Cut-and-solve: An iterative search strategy for combinatorial optimization problems ⋮ Breadth-first heuristic search ⋮ Adopt: asynchronous distributed constraint optimization with quality guarantees ⋮ Open constraint programming ⋮ Search combinators ⋮ Efficient interval partitioning-local search collaboration for constraint satisfaction ⋮ Bidirectional heuristic search with limited resources ⋮ Agent search in uniform b-ary trees: Multiple goals and unequal costs ⋮ Reducing reexpansions in iterative-deepening search by controlling cutoff bounds ⋮ Principles of metareasoning ⋮ Dynamically improved bounds bidirectional search ⋮ Subproblem ordering heuristics for AND/OR best-first search ⋮ Batch repair actions for automated troubleshooting ⋮ Rational deployment of multiple heuristics in optimal state-space search ⋮ Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning ⋮ Effective use of memory in iterative deepening search ⋮ Linear-space best-first search ⋮ Iterative-deepening search with on-line tree size prediction ⋮ Efficient interval partitioning for constrained global optimization ⋮ A Prolog technology theorem prover: A new exposition and implementation in Prolog ⋮ Execution of logic programs by iterative-deepening A\(^*\) SLD-tree search ⋮ Logic programming, abduction and probability. A top-down anytime algorithm for estimating prior and posterior probabilities ⋮ Predicting optimal solution cost with conditional probabilities ⋮ Improving the efficiency of depth-first search by cycle elimination ⋮ Potential-based bounded-cost search and anytime non-parametric A* ⋮ Reactive scheduling in the multi-mode RCPSP ⋮ Set-structured and cost-sharing heuristics for classical planning ⋮ Heuristic shortest path algorithms for transportation applications: state of the art ⋮ Finding optimal solutions to the graph partitioning problem with heuristic search ⋮ Refinements to depth-first iterative-deepening search in automatic theorem proving ⋮ A pathfinding problem for search trees with unknown edge length ⋮ Bucket elimination for multiobjective optimization problems ⋮ A complete search method for the relaxed traveling tournament problem ⋮ On the connection between the phase transition of the covering test and the learning success rate in ILP ⋮ Recursive query processing: The power of logic ⋮ Heuristic search in restricted memory ⋮ Parallel state-space search for a first solution with consistent linear speedups ⋮ Term rewriting: Some experimental results ⋮ Comparison of iterative improvement techniques for schedule optimization ⋮ Probably bounded suboptimal heuristic search ⋮ Controlling sub-tournaments: easy or hard problem? Theoretical vs. practical analysis ⋮ Enhancing stochastic search performance by value-biased randomization of heuristics ⋮ Sokoban: Improving the search with relevance cuts ⋮ Strategies of node selection in search procedures for solving combinatorial optimization problems: A survey and a general formalization ⋮ \(\text{BIDA}^*\): An improved perimeter search algorithm ⋮ Subdimensional expansion for multirobot path planning ⋮ Conflict-based search for optimal multi-agent pathfinding ⋮ Implementing tactics and tacticals in a higher-order logic programming language ⋮ Depth-first iterative-deepening: An optimal admissible tree search ⋮ \textsf{Goéland}: a concurrent tableau-based theorem prover (system description) ⋮ Unifying single-agent and two-player search ⋮ Games, computers, and artificial intelligence ⋮ Heuristics as Markov chains ⋮ Proof-number search ⋮ Controlling the learning process of real-time heuristic search
Cites Work
This page was built for publication: Depth-first iterative-deepening: An optimal admissible tree search
