Genetic algorithms + data structures = evolution programs (3rd ed.)
Genetic algorithms + data structures = evolution programs (3rd ed.)
Bucket elimination: a unifying framework for reasoning
Artificial Intelligence
A genetic local search algorithm for random binary constraint satisfaction problems
SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 1
Mini-buckets: A general scheme for bounded inference
Journal of the ACM (JACM)
Co-evolutionary Constraint Satisfaction
PPSN III Proceedings of the International Conference on Evolutionary Computation. The Third Conference on Parallel Problem Solving from Nature: Parallel Problem Solving from Nature
New Search Heuristics for Max-CSP
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Constraint Processing
The breakout method for escaping from local minima
AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence
Comparing evolutionary algorithms on binary constraint satisfaction problems
IEEE Transactions on Evolutionary Computation
| Hi-index | 0.00 |
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.