Some tests of generalized bisection
ACM Transactions on Mathematical Software (TOMS)
Algorithm 681: INTBIS, a portable interval Newton/bisection package
ACM Transactions on Mathematical Software (TOMS)
ILPS '94 Proceedings of the 1994 International Symposium on Logic programming
Solving Polynomial Systems Using a Branch and Prune Approach
SIAM Journal on Numerical Analysis
Subdivision Direction Selection in Interval Methods for Global Optimization
SIAM Journal on Numerical Analysis
Algorithm 852: RealPaver: an interval solver using constraint satisfaction techniques
ACM Transactions on Mathematical Software (TOMS)
Consistency techniques for numeric CSPs
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Constructive interval disjunction
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Autonomous Search
Preventing design conflicts in distributed design systems composed of heterogeneous agents
Engineering Applications of Artificial Intelligence
| Hi-index | 0.00 |
Bisection is a search algorithm for numerical CSPs. The main principle is to select one variable at every node of the search tree and to bisect its interval domain. In this paper, we introduce a new adaptive variable selection strategy following an intensification diversification approach. Intensification is implemented by the maximum smear heuristic. Diversification is obtained by a round-robin ordering on the variables. The balance is automatically adapted during the search according to the solving state. Experimental results from a set of standard benchmarks show that this new strategy is more robust. Moreover, it is particularly efficient for solving the well-known Transistor problem, illustrating the benefits of an adaptive search.