Pages that link to "Item:Q3768428"
From MaRDI portal
The following pages link to Generalized best-first search strategies and the optimality of A* (Q3768428):
Displaying 50 items.
- Balanced multi-perspective checking of process conformance (Q272169) (← links)
- Reducing the solution space of optimal task scheduling (Q336912) (← links)
- A numerical study of the bottom-up and top-down inference processes in and-or graphs (Q408929) (← links)
- K\(^{\ast}\): A heuristic search algorithm for finding the \(k\) shortest paths (Q420803) (← links)
- Information-theoretic approaches to branching in search (Q429675) (← links)
- A comparison of heuristic best-first algorithms for bicriterion shortest path problems (Q439323) (← links)
- Sparse reconstruction for bioluminescence tomography based on the semigreedy method (Q454674) (← links)
- A survey of motion planning algorithms from the perspective of autonomous UAV guidance (Q614803) (← links)
- Inconsistent heuristics in theory and practice (Q646508) (← links)
- Linear-space best-first search (Q685539) (← links)
- Average-case analysis of best-first search in two representative directed acyclic graphs (Q814592) (← links)
- Heuristic search for one-to-many shortest path queries (Q825009) (← links)
- Weighted \(A^*\) search - unifying view and application (Q840833) (← links)
- Lower bound sets for biobjective shortest path problems (Q905755) (← links)
- Waveprint: Efficient wavelet-based audio fingerprinting (Q941595) (← links)
- Memory intensive AND/OR search for combinatorial optimization in graphical models (Q1045991) (← links)
- Admissibility of \(AO^ *\) when heuristics overestimate (Q1102135) (← links)
- \(BS^*:\) An admissible bidirectional staged heuristic search algorithm (Q1115210) (← links)
- Increasing search efficiency using multiple heuristics (Q1119028) (← links)
- A new result on the complexity of heuristic estimates for the \(A^*\) algorithm (Q1193486) (← links)
- Effective use of memory in iterative deepening search (Q1198022) (← links)
- Utility of pathmax in partial order heuristic search (Q1352123) (← links)
- An upper bound on the time complexity of iterative-deepening-\(A^*\) (Q1354042) (← links)
- A solution to the GHI problem for best-first search (Q1589511) (← links)
- Heuristic allocation based on a dynamic programming state-space representation (Q1602778) (← 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 genetic algorithm for the zen puzzle garden game (Q1761727) (← links)
- Intelligent transportation systems -- Enabling technologies (Q1906952) (← links)
- Comparison of the number of nodes explored by cyclic best first search with depth contour and best first search (Q2026990) (← links)
- Some new perspectives for solving 0--1 integer programming problems using balas method (Q2051155) (← links)
- A framework for analysing state-abstraction methods (Q2060741) (← links)
- Dynamically improved bounds bidirectional search (Q2238652) (← links)
- Remarks on the \(\mathrm A^{\ast\ast}\) algorithm (Q2254543) (← links)
- Evaluating the impact of AND/OR search on 0-1 integer linear programming (Q2267805) (← links)
- Job sequencing with one common and multiple secondary resources: an A*/beam search based anytime algorithm (Q2289017) (← links)
- Conflict-based search for optimal multi-agent pathfinding (Q2343829) (← links)
- Anytime search in dynamic graphs (Q2389673) (← links)
- Breadth-first heuristic search (Q2457631) (← links)
- Automated theorem proving in Euler diagram systems (Q2467560) (← links)
- Finding optimal solutions to the graph partitioning problem with heuristic search (Q2502154) (← links)
- Conflict-directed \(A^{*}\) and its role in model-based embedded systems (Q2643303) (← links)
- Epsilon-transformation: exploiting phase transitions to solve combinatorial optimization problems (Q2674191) (← links)
- Computation of the optimal value function in time-dependent networks (Q2811299) (← links)
- A branch, bound, and remember algorithm for the simple assembly line balancing problem (Q2815457) (← links)
- Efficiently Listing Bounded Length st-Paths (Q2946068) (← links)
- Bounds for the Quantifier Depth in Finite-Variable Logics (Q2946761) (← links)
- PARSSSE: AN ADAPTIVE PARALLEL STATE SPACE SEARCH ENGINE (Q3144924) (← links)
- Merge-and-Shrink Abstraction (Q3189651) (← links)
- Probabilistic CEGAR (Q3512491) (← links)
