Pages that link to "Item:Q1062761"
From MaRDI portal
The following pages link to Depth-first iterative-deepening: An optimal admissible tree search (Q1062761):
Displaying 50 items.
- An upper bound on the time complexity of iterative-deepening-\(A^*\) (Q1354042) (← links)
- A new variant of the \(A^*\)-algorithm which closes a node at most once. (Q1354068) (← links)
- Searching minimax game trees under memory space constraint (Q1356215) (← links)
- Probabilistic conflicts in a search algorithm for estimating posterior probabilities in Bayesian networks (Q1391897) (← links)
- Non-Horn clause logic programming (Q1402738) (← links)
- Sokoban: Improving the search with relevance cuts (Q1589512) (← links)
- Strategies of node selection in search procedures for solving combinatorial optimization problems: A survey and a general formalization (Q1592632) (← links)
- Unifying single-agent and two-player search (Q1602466) (← links)
- Games, computers, and artificial intelligence (Q1603559) (← links)
- Symbolic perimeter abstraction heuristics for cost-optimal planning (Q1647507) (← links)
- An exact algorithm for the blocks relocation problem with new lower bounds (Q1654367) (← links)
- Subproblem ordering heuristics for AND/OR best-first search (Q1745717) (← links)
- Rational deployment of multiple heuristics in optimal state-space search (Q1748476) (← links)
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
- A pathfinding problem for search trees with unknown edge length (Q1784979) (← links)
- \(\text{BIDA}^*\): An improved perimeter search algorithm (Q1855228) (← links)
- Intelligent transportation systems -- Enabling technologies (Q1906952) (← links)
- Improving search efficiency using possible subgoals (Q1906981) (← links)
- Batch repair actions for automated troubleshooting (Q1989400) (← links)
- Potential-based bounded-cost search and anytime non-parametric A* (Q2014923) (← links)
- \textsf{Goéland}: a concurrent tableau-based theorem prover (system description) (Q2104525) (← links)
- Improving the robustness of EPS to solve the TSP (Q2170194) (← links)
- Nonlinear and temporal multiscale dynamics of gene regulatory networks: a qualitative simulator (Q2228793) (← links)
- Dynamically improved bounds bidirectional search (Q2238652) (← links)
- Iterative-deepening search with on-line tree size prediction (Q2248554) (← links)
- Predicting optimal solution cost with conditional probabilities (Q2254628) (← links)
- Set-structured and cost-sharing heuristics for classical planning (Q2268919) (← links)
- Probably bounded suboptimal heuristic search (Q2321255) (← links)
- Controlling sub-tournaments: easy or hard problem? Theoretical vs. practical analysis (Q2330543) (← links)
- Subdimensional expansion for multirobot path planning (Q2343828) (← links)
- Conflict-based search for optimal multi-agent pathfinding (Q2343829) (← links)
- Heuristics as Markov chains (Q2350029) (← links)
- Duality in permutation state spaces and the dual search algorithm (Q2389626) (← links)
- Anytime search in dynamic graphs (Q2389673) (← links)
- Resource access control for dynamic priority distributed real-time systems (Q2432057) (← links)
- Increasing threshold search for best-valued agents (Q2446584) (← links)
- Computational protein design as an optimization problem (Q2453727) (← links)
- Towards a unified model of search in theorem-proving: subgoal-reduction strategies (Q2456542) (← links)
- Maximizing over multiple pattern databases speeds up heuristic search (Q2457594) (← links)
- Cut-and-solve: An iterative search strategy for combinatorial optimization problems (Q2457618) (← links)
- Breadth-first heuristic search (Q2457631) (← links)
- Adopt: asynchronous distributed constraint optimization with quality guarantees (Q2457704) (← links)
- Open constraint programming (Q2457706) (← links)
- Efficient interval partitioning-local search collaboration for constraint satisfaction (Q2459380) (← links)
- Heuristic shortest path algorithms for transportation applications: state of the art (Q2499162) (← links)
- Finding optimal solutions to the graph partitioning problem with heuristic search (Q2502154) (← links)
- Bucket elimination for multiobjective optimization problems (Q2506234) (← links)
- A complete search method for the relaxed traveling tournament problem (Q2513735) (← links)
- Enhancing stochastic search performance by value-biased randomization of heuristics (Q2573000) (← links)
- Real-time heuristic search (Q2639648) (← links)
