198 search results - page 40 / 40 » Colouring, constraint satisfaction, and complexity |
106
click to vote
UAI
1997
14 years 10 months ago
1997
This paper describes a class ofprobabilistic approximation algorithms based on bucket elimination which o er adjustable levels of accuracy ande ciency. We analyzethe approximation...
AAAI
1996
14 years 10 months ago
1996
Arc consistency filtering is widely used in the framework of binary constraint satisfaction problems: with a low complexity, inconsistency may be detected,and domains are filtered...
CP
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. We study the lattice structure of sets (monoids) of surjective hyper-operations on an n-element domain. Through a Galois connection, these monoids form the algebraic coun...