1986 search results - page 25 / 398 » constraints 2006 |
IPL
2000
13 years 7 months ago
2000
An approximation algorithm for a constraint satisfaction problem is said to be nontrivial if its performance ratio is strictly superior to the expected performance of the algorith...
IPL
2000
13 years 7 months ago
2000
We show that stratified context unification, which is one of the most expressive fragments of context unification known to be decidable, is equivalent to the satisfiability proble...
AAAI
2006
13 years 9 months ago
2006
Symmetry in constraint satisfaction problems (CSPs) has been considered in two fundamentally different ways: as an operation preserving the solutions of a CSP instance, or as an o...
RTSS
2006
IEEE
14 years 1 months ago
2006
IEEE
AUSAI
2006
Springer
13 years 11 months ago
2006
Springer