1051 search results - page 33 / 211 » Foundations of Constraint Satisfaction |
UM
2009
Springer
15 years 4 months ago
2009
Springer
Ideally designed software allow users to explore and pursue interleaving plans, making it challenging to automatically recognize user interactions. The recognition algorithms prese...
AMAI
2004
Springer
15 years 3 months ago
2004
Springer
In this paper the use of graph isomorphism is investigated within the framework of symmetry breaking in constraint satisfaction problems. A running example of Comma-free codes is ...
GECCO
2003
Springer
15 years 3 months ago
2003
Springer
Estimation of Distribution Algorithms (EDAs) are new promising methods in the field of genetic and evolutionary algorithms. In the case of conventional Genetic and Evolutionary Al...
EVOW
2008
Springer
14 years 11 months ago
2008
Springer
This paper introduces a hybrid Tabu Search - Evolutionary Algorithm for solving the binary constraint satisfaction problem, called CTLEA. A continuation of an earlier introduced al...
IJCAI
1989
14 years 11 months ago
1989
We describe a general technique for expressing domain knowledge in constraint satisfaction problems, and using it to develop optimized parallel arc consistency algorithms for the ...