Phase transitions and the search problem
Artificial Intelligence - Special volume on frontiers in problem solving: phase transitions and complexity
Experimental results on the crossover point in random 3-SAT
Artificial Intelligence - Special volume on frontiers in problem solving: phase transitions and complexity
Specifying Latin square problems in propositional logic
Automated reasoning and its applications
Upper Bounds for the Total Path Length of Binary Trees
Journal of the ACM (JACM)
Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems
Journal of Automated Reasoning
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Global Cut Framework for Removing Symmetries
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Binary search trees of bounded balance
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
A Dichotomic Search Algorithm for Mining and Learning in Domain-Specific Logics
Fundamenta Informaticae - Advances in Mining Graphs, Trees and Sequences
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Optimization in SMT with LA(Q) cost functions
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Lower bounds and upper bounds for MaxSAT
LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization
Constraints
| Hi-index | 0.00 |
We devise a theoretical model for dichotomic search algorithms for constrained optimization. We show that, within our model, a certain way of choosing the breaking point minimizes both expected as well as worst case performance in a skewed binary search. Furthermore, we show that our protocol is optimal in the expected and in the worst case. Experimental results illustrate performance gains when our protocols are used within the search strategy by Streeter and Smith.