Pages that link to "Item:Q1062761"
From MaRDI portal
The following pages link to Depth-first iterative-deepening: An optimal admissible tree search (Q1062761):
Displayed 50 items.
- Refinements to depth-first iterative-deepening search in automatic theorem proving (Q582116) (← links)
- Agent search in uniform b-ary trees: Multiple goals and unequal costs (Q671265) (← links)
- Linear-space best-first search (Q685539) (← links)
- Execution of logic programs by iterative-deepening A\(^*\) SLD-tree search (Q688625) (← links)
- Logic programming, abduction and probability. A top-down anytime algorithm for estimating prior and posterior probabilities (Q688819) (← links)
- Parallel state-space search for a first solution with consistent linear speedups (Q757044) (← links)
- Term rewriting: Some experimental results (Q757071) (← links)
- Controlling the learning process of real-time heuristic search (Q814454) (← links)
- The impact of search heuristics on heavy-tailed behaviour (Q850467) (← links)
- Near-optimal online control of dynamic discrete-event systems (Q858148) (← links)
- The \((n^ 2-1)\)-puzzle and related relocation problems (Q917310) (← links)
- Efficient interval partitioning for constrained global optimization (Q956597) (← links)
- Depth-first iterative-deepening: An optimal admissible tree search (Q1062761) (← links)
- A Prolog technology theorem prover: Implementation by an extended Prolog compiler (Q1114446) (← links)
- Parallel depth first search. I: Implementation (Q1116343) (← links)
- Parallel depth first search. II: Analysis (Q1116344) (← links)
- Benefits of using multivalued functions for minimaxing (Q1128640) (← links)
- Pruning algorithms for multi-model adversary search (Q1128651) (← links)
- Bidirectional heuristic search with limited resources (Q1183503) (← links)
- Reducing reexpansions in iterative-deepening search by controlling cutoff bounds (Q1187216) (← links)
- Principles of metareasoning (Q1187348) (← links)
- Effective use of memory in iterative deepening search (Q1198022) (← links)
- A Prolog technology theorem prover: A new exposition and implementation in Prolog (Q1199932) (← links)
- Improving the efficiency of depth-first search by cycle elimination (Q1209308) (← links)
- Recursive query processing: The power of logic (Q1262144) (← links)
- Heuristic search in restricted memory (Q1263290) (← links)
- Comparison of iterative improvement techniques for schedule optimization (Q1278321) (← links)
- Implementing tactics and tacticals in a higher-order logic programming language (Q1311396) (← links)
- Proof-number search (Q1321057) (← links)
- IDNAF Prolog (Q1328781) (← links)
- Iterative versionspaces (Q1337690) (← links)
- Agent searching in a tree and the optimality of iterative deepening (Q1341670) (← links)
- Controlled integration of the cut rule into connection tableau calculi (Q1344875) (← links)
- A real-time algorithm for the \((n^{2}-1)\)-puzzle (Q1350227) (← links)
- Iterative deepening multiobjective \(A^{*}\) (Q1351151) (← links)
- Perimeter search in restricted memory (Q1352758) (← links)
- 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)
- \(\text{BIDA}^*\): An improved perimeter search algorithm (Q1855228) (← links)
- Intelligent transportation systems -- Enabling technologies (Q1906952) (← links)
- Improving search efficiency using possible subgoals (Q1906981) (← links)
- Resource access control for dynamic priority distributed real-time systems (Q2432057) (← links)
- Towards a unified model of search in theorem-proving: subgoal-reduction strategies (Q2456542) (← links)