405 search results - page 28 / 81 » On the Complexity of Global Constraint Satisfaction |
CADE
2010
Springer
15 years 5 days ago
2010
Springer
Coalgebraic description logics offer a common semantic umbrella for extensions of description logics with reasoning principles outside relational semantics, e.g. quantitative uncer...
AUSAI
2006
Springer
15 years 2 months ago
2006
Springer
A widely adopted approach to solving constraint satisfaction problems combines systematic tree search with constraint propagation for pruning the search space. Constraint propagati...
CVPR
2004
IEEE
16 years 1 months ago
2004
IEEE
Abstract-- Efficient detection of globally optimal surfaces representing object boundaries in volumetric datasets is important and remains challenging in many medical image analysi...
140
click to vote
FOCS
2002
IEEE
15 years 4 months ago
2002
IEEE
The Constraint Satisfaction Problem (CSP) provides a common framework for many combinatorial problems. The general CSP is known to be NP-complete; however, certain restrictions on...
CISSE
2008
Springer
15 years 25 days ago
2008
Springer
: Many real world problems appear naturally as constraints satisfaction problems (CSP), for which very efficient algorithms are known. Most of these involve the combination of two ...