Heuristics: intelligent search strategies for computer problem solving
Heuristics: intelligent search strategies for computer problem solving
AND/OR graph heuristic search methods
Journal of the ACM (JACM)
Searching with probabilities
Generalized best-first search strategies and the optimality of A*
Journal of the ACM (JACM)
Stochastic Modeling of Branch-and-Bound Algorithms with Best-First Search
IEEE Transactions on Software Engineering - Special issue on COMPSAC 1982 and 1983
Denotational semantics: a methodology for language development
Denotational semantics: a methodology for language development
Principles of artificial intelligence
Principles of artificial intelligence
Generalization of alpha-beta SSS* search procedures
Artificial Intelligence
New computer methods for global optimization
New computer methods for global optimization
Inclusion functions and global optimization 11
Mathematical Programming: Series A and B
A general branch-and-bound formulation for and/or graph and game tree search
Search in Artificial Intelligence
Control strategies for two-player games
ACM Computing Surveys (CSUR)
Time-efficient state space search
Artificial Intelligence
Space-efficient search algorithms
ACM Computing Surveys (CSUR)
Artificial Intelligence
Best-first fixed-depth minimax algorithms
Artificial Intelligence
Subdivision Direction Selection in Interval Methods for Global Optimization
SIAM Journal on Numerical Analysis
Robust multi-objective feedback design by quantifier elimination
Journal of Symbolic Computation - Special issue: applications of quantifier elimination
Quantified constraints under perturbation
Journal of Symbolic Computation
A Constraint Satisfaction Approach to a Circuit Design Problem
Journal of Global Optimization
New Subinterval Selection Criteria for Interval Global Optimization
Journal of Global Optimization
Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition
Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
Heuristic Search Strategies for Cylindrical Algebraic Decomposion
AISMC-1 Proceedings of the International Conference on Artificial Intelligence and Symbolic Mathematical Computation
Continuous First-Order Constraint Satisfaction
AISC '02/Calculemus '02 Proceedings of the Joint International Conferences on Artificial Intelligence, Automated Reasoning, and Symbolic Computation
Numerica: a modeling language for global optimization
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Efficient solving of quantified inequality constraints over the real numbers
ACM Transactions on Computational Logic (TOCL)
SIAM Journal on Control and Optimization
A robust interpretation of duration calculus
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
| Hi-index | 0.00 |
In this paper we study search heuristics for box decomposition methods that solve problems such as global optimization, minimax optimization, or quantified constraint solving. For this we unify these methods under a branch-and-bound framework, and develop a model that is more convenient for studying heuristics for such algorithms than the traditional models from Artificial Intelligence. We use the result to prove various theorems about heuristics and apply the outcome to the box decomposition methods under consideration. We support the findings with timings for the method of quantified constraint solving developed by the author.