A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Escaping Local Optima: Constraint Weights vs. Value Penalties
Research and Development in Intelligent Systems XXIV
Constraint Satisfaction Problems can be solved using either iterative improvement or constructive search approaches. Iterative improvement techniques converge quicker than the constructive search techniques on large problems, but they have a propensity to converge to local optima. Therefore, a key research topic on iterative improvement search is the development of effective techniques for escaping local optima, most of which are based on increasing the weights attached to violated constraints.doi:10.1007/978-1-84800-094-0_5 dblp:conf/sgai/BasharuAA07a fatcat:wgegxk2qsfhntbe7ek5rm7huby