380 search results - page 42 / 76 » Cluster Graphs as Abstractions for Constraint Satisfaction P... |
IJCAI
2003
13 years 10 months ago
2003
Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to detect unso...
4OR
2007
13 years 8 months ago
2007
Abstract We show that a well-known linearization technique initially proposed for quadratic assignment problems can be generalized to a broader class of quadratic 0-1 mixed-integer...
CP
2006
Springer
14 years 12 days ago
2006
Springer
Abstract. In the last decades, the Satisfiability and Constraint Satisfaction Problem frameworks were extended to integrate aspects such as uncertainties, partial observabilities, ...
SARA
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. This article introduces a technique for improving the efficiency of diagnosis through approximate compilation. We extend the approach of compiling a diagnostic model, as...
MICCAI
2009
Springer
14 years 9 months ago
2009
Springer
Abstract. We show that a simple probabilistic modelling of the registration problem for surfaces allows to solve it by using standard clustering techniques. In this framework, poin...