Browsing by Subject "Penalty based algorithm"
Now showing items 1-1 of 1
(Springer Verlag http://dx.doi.org/10.1007/978-1-84800-094-0_5, 2007)BASHARU, M., ARANA, I. and AHRIZ, H. 2007. Escaping local optima: constraint weights vs. value penalties. In: M. BRAMER, F. COENEN and PETRIDIS, M. (eds.) Research and development in intelligent systems XXIV. Proceedings of the 27th SGAI International Conference on Artificial Intelligence, AI-07, 10-12 December 2007. Cambridge. pp. 51-64Constraint 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 ...