1300 search results - page 71 / 260 » Constraint satisfaction problems and global cardinality cons... |
85
Voted
EVOW
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Bucket elimination (BE) is an exact technique based on variable elimination, commonly used for solving constraint satisfaction problems. We consider the hybridization of ...
73
Voted
CIE
2008
Springer
14 years 10 months ago
2008
Springer
We study the complexity of the model checking problem, for fixed models A, over certain fragments L of first-order logic, obtained by restricting which of the quantifiers and boole...
101
Voted
CP
1999
Springer
15 years 2 months ago
1999
Springer
A lot of work in constraint satisfaction has been focused on finding solutions to difficult problems. Many real life problems however, while not extremely complicated, have a huge...
93
Voted
AAAI
1997
14 years 11 months ago
1997
The use of heuristics as a means to improve constraint solver performance has been researched widely. However, most work has been on problem-independentheuristics (e.g., variable ...
97
Voted
PACT
1999
Springer
15 years 2 months ago
1999
Springer
Many problems from artificial intelligence can be described as constraint satisfaction problems over finite domains (CSP(FD)), that is, a solution is an assignment of a value to ...