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 41 items.
- Optimal composition of real-time systems (Q2674202) (← links)
- Best-first fixed-depth minimax algorithms (Q2676580) (← links)
- Robot path planning based on concept lattice (Q2677852) (← links)
- Solving the Pricing Problem in a Branch-and-Price Algorithm for Graph Coloring Using Zero-Suppressed Binary Decision Diagrams (Q2806865) (← links)
- Minimal Proof Search for Modal Logic K Model Checking (Q2915084) (← links)
- A Quantitative Study of $$2 \times 4$$ Chinese Dark Chess (Q2947918) (← links)
- Block Crossings in Storyline Visualizations (Q2961533) (← links)
- Parallel multithreaded IDA* heuristic search: algorithm design and performance evaluation (Q3072379) (← links)
- Heuristic tree search with nonparametric statistical inference methods (Q3210918) (← links)
- HEURISTIC SEARCH UNDER CONTRACT (Q3224350) (← links)
- Comparison of Simulated Annealing, Interval Partitioning and Hybrid Algorithms in Constrained Global Optimization (Q3509411) (← links)
- Survey on Directed Model Checking (Q3614878) (← links)
- A Flexible Search Framework for CHR (Q3616878) (← links)
- Hierarchical Adaptive State Space Caching Based on Level Sampling (Q3617761) (← links)
- An efficient relational deductive system for propositional non-classical logics (Q3647245) (← links)
- Two-agent IDA* (Q4421276) (← links)
- Planning as tabled logic programming (Q4592996) (← links)
- (Q4636970) (← links)
- Optimizing proof search in model elimination (Q4647531) (← links)
- On searching explanatory argumentation graphs (Q4995618) (← links)
- Iterative Deepening Dynamically Improved Bounds Bidirectional Search (Q5086001) (← links)
- Optimization Bounds from the Branching Dual (Q5139843) (← links)
- Building Theorem Provers (Q5191110) (← links)
- The search efficiency of theorem proving strategies (Q5210762) (← links)
- A DEEP IMPROVER OF TWO-MOVE CHESS MATE PROBLEMS (Q5489314) (← links)
- Performance of linear-space search algorithms (Q5917443) (← links)
- Performance of linear-space search algorithms (Q5925571) (← links)
- Controlled use of clausal lemmas in connection tableau calculi (Q5927985) (← links)
- Iterative state-space reduction for flexible computation (Q5940821) (← links)
- Planning as heuristic search (Q5941310) (← links)
- Time complexity of iterative-deepening-\(A^{*}\) (Q5941316) (← links)
- The \(PN^{*}\)-search algorithm: Application to tsume-shogi (Q5941318) (← links)
- Planning and control in artificial intelligence: A unifying perspective (Q5945807) (← links)
- Heuristic search strategies for multiobjective state space search (Q5955789) (← links)
- Disjoint pattern database heuristics (Q5958199) (← links)
- Games solved: Now and in the future (Q5958209) (← links)
- Algorithm for optimal winner determination in combinatorial auctions (Q5958538) (← links)
- Computer Go: An AI oriented survey (Q5958709) (← links)
- Automated generation of readable proofs with geometric invariants. I: Multiple and shortest proof generation (Q5961492) (← links)
- A general efficient neighborhood structure framework for the job-shop and flexible job-shop scheduling problems (Q6096569) (← links)
- On improving the regional transportation efficiency based on federated learning (Q6099854) (← links)
