Abstract

In this paper we present a new stochastic search algorithm which is designed to solve finite binary constraint satisfaction problems, where constraints of the “not equal” type predominate. The experiments show that, in comparison with the backtrack-based algorithms, the presented algorithm is superior when it is used to solve problems of large dimension with many solutions.

File
loenko.pdf99.98 KB
Issue
Pages
45-55