711 search results - page 34 / 143 » Amalgams of Constraint Satisfaction Problems |
99
Voted
ECSQARU
2009
Springer
14 years 9 months ago
2009
Springer
We claim that divisible residuated lattices (DRLs) can act as a unifying evaluation framework for soft constraint satisfaction problems (soft CSPs). DRLs form the algebraic semanti...
AAAI
1994
15 years 1 months ago
1994
We present the results of an empirical study of several constraint satisfaction search algorithms and heuristics. Using a random problem generator that allows us to create instanc...
CEC
2007
IEEE
15 years 6 months ago
2007
IEEE
—Constraint satisfaction problems (CSPs) widely occur in artificial intelligence. In the last twenty years, many algorithms and heuristics were developed to solve CSP. Recently,...
109
click to vote
AAAI
2006
15 years 1 months ago
2006
We present a new formulation of distributed task assignment, called Generalized Mutual Assignment Problem (GMAP), which is derived from an NP-hard combinatorial optimization probl...
SODA
2001
ACM
15 years 1 months ago
2001
ACM
We consider worst case time bounds for NP-complete problems including 3-SAT, 3-coloring, 3-edge-coloring, and 3list-coloring. Our algorithms are based on a constraint satisfaction...