717 search results - page 82 / 144 » Weak-Commitment Search for Solving Constraint Satisfaction P... |
137
click to vote
CONSTRAINTS
2008
15 years 1 months ago
2008
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
117
click to vote
SARA
2005
Springer
15 years 7 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...
CP
2007
Springer
15 years 7 months ago
2007
Springer
In this paper we present new techniques for improving backtracking based Quantified Constraint Satisfaction Problem (QCSP) solvers. QCSP is a generalization of CSP in which variab...
100
Voted
CP
1998
Springer
15 years 5 months ago
1998
Springer
We study how constraint-based static analysis can be applied to the automated and systematic debugging of program errors. Strongly moding and constraint-based mode analysis are tur...
157
click to vote
TASE
2010
IEEE
14 years 8 months ago
2010
IEEE
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...