Abstract
This paper presents a simple way of combining inference with stochastic search for solving constraint satisfaction problems. The approach makes use of an evolutionary algorithm for search assisted by an inference algorithm, the variable elimination procedure. The hybrid algorithm obtained is adapted in such way that a balance between exploitation and exploration is preserved. The results are presented for the Max-CSP optimization task. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Ionita, M., Croitoru, C., & Breaban, M. (2006). Incorporating inference into evolutionary algorithms for max-CSP. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4030 LNCS, pp. 139–149). Springer Verlag. https://doi.org/10.1007/11890584_11
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
