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 18 items.
- An online multi-agent co-operative learning algorithm in POMDPs (Q3543674) (← links)
- A Comparative Study of Task Assignment and Path Planning Methods for Multi-UGV Missions (Q3589741) (← links)
- Survey on Directed Model Checking (Q3614878) (← links)
- (Q4028101) (← links)
- On the Optimality of Randomized $\alpha$-$\beta$ Search (Q4326858) (← links)
- AStarix: Fast and Optimal Sequence-to-Graph Alignment (Q5041800) (← links)
- IDB-ADOPT: A Depth-First Search DCOP Algorithm (Q5191411) (← links)
- Solving the Watchman Route Problem with Heuristic Search (Q5870496) (← links)
- Performance of linear-space search algorithms (Q5917443) (← links)
- Performance of linear-space search algorithms (Q5925571) (← links)
- LAO*: A heuristic search algorithm that finds solutions with loops (Q5941311) (← links)
- A general scheme for automatic generation of search heuristics from specification \(dependencies^{*}\) (Q5941313) (← links)
- Heuristic search strategies for multiobjective state space search (Q5955789) (← links)
- Learning for efficient search (Q5955790) (← links)
- Conflict-tolerant and conflict-free multi-agent meeting (Q6136090) (← links)
- Computing alignments with maximum synchronous moves via replay in coordinate planes (Q6191633) (← links)
- Heuristically ordered search in state graphs (Q6602248) (← links)
- Augmenting bi-objective branch and bound by scalarization-based information (Q6616273) (← links)
