717 search results - page 52 / 144 » Weak-Commitment Search for Solving Constraint Satisfaction P... |
IJCAI
2007
14 years 11 months ago
2007
Enforcing arc consistency (AC) during search has proven to be a very effective method in solving Constraint Satisfaction Problems and it has been widely-used in many Constraint Pr...
CPAIOR
2008
Springer
14 years 11 months ago
2008
Springer
Solution-Guided Multi-Point Constructive Search (SGMPCS) is a complete, constructive search technique that has been shown to out-perform standard constructive search techniques on ...
CP
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. The constraint satisfaction problem can be solved in polynomial time for instances where certain parameters (e.g., the treewidth of primal graphs) are bounded. However, t...
ATAL
2003
Springer
15 years 3 months ago
2003
Springer
This paper focuses on a task allocation problem, particularly in cases where the task is to find a solution to a search problem or a constraint satisfaction problem. If the searc...
ASPDAC
1999
ACM
15 years 2 months ago
1999
ACM
We present an algorithm for solving a general min-cut, twoway partitioning problem subject to timing constraints. The problem is formulated as a constrained programming problem an...