The following pages link to (Q4040217):
Displaying 20 items.
- General branch and bound, and its relation to \(A^*\) and \(AO^*\) (Q792768) (← links)
- The complexity of a simple stochastic OR-tree model in which ``directional search'' is bad (Q915453) (← links)
- Human-guided search (Q972653) (← links)
- AND/OR branch-and-bound search for combinatorial optimization in graphical models (Q1045990) (← links)
- Memory intensive AND/OR search for combinatorial optimization in graphical models (Q1045991) (← links)
- An intelligent interactive project management support system (Q1129303) (← links)
- A note on cognitive maps: An optimal spatial knowledge representation (Q1184256) (← links)
- Algorithms for searching explicit AND/OR graphs and their applications to problem reduction search (Q1321063) (← links)
- Iterative deepening multiobjective \(A^{*}\) (Q1351151) (← links)
- Heuristic search and pruning in polynomial constraints satisfaction (Q1370613) (← links)
- Unifying single-agent and two-player search (Q1602466) (← links)
- A unifying approach to heuristic search (Q1897398) (← links)
- Intelligent transportation systems -- Enabling technologies (Q1906952) (← links)
- Global sensing search for nonlinear global optimization (Q2124800) (← links)
- Evaluating the impact of AND/OR search on 0-1 integer linear programming (Q2267805) (← links)
- An Event-Driven Algorithm for Agents on the Web (Q3627855) (← links)
- Searching with probabilities (Q3992828) (← links)
- European Summer Meeting of the Association for Symbolic Logic (Q5966661) (← links)
- A Guided Tour of Artificial Intelligence Research (Q6487775) (← links)
- Heuristically ordered search in state graphs (Q6602248) (← links)
