General branch and bound, and its relation to A* and AO*
Artificial Intelligence
Principles of artificial intelligence
Principles of artificial intelligence
A Sufficient Condition for Backtrack-Free Search
Journal of the ACM (JACM)
Optimizing decision trees through heuristically guided search
Communications of the ACM
Equivalence between AND/OR graphs and context-free grammars
Communications of the ACM
Handbook of AI
Fundamentals of Computer Alori
Fundamentals of Computer Alori
Art and Theory of Dynamic Programming
Art and Theory of Dynamic Programming
Dynamic Programming
A unified approach to problem solving search procedures
A unified approach to problem solving search procedures
| Hi-index | 0.00 |
With the help of a model for discrete optimization problems, we show that a large number of heuristic search procedures (for searching state-space graphs, AND/OR graphs, game trees, etc.) of artificial intelligence (AI), and dynamic programming (DP) and branch-and-bound (B&B) procedures of operations research use problem-specific knowledge in a framework based upon context-free grammar. The model reveals the true nature of these procedures, and aids in synthesizing new variations as well as generalizations and parallel implementations of these procedures. The paper concludes by commenting upon how this model may be generalized and made more powerful to encompass a greater variety of problems, and to help synthesize more efficient search procedures.