417 search results - page 19 / 84 » In Search of the Best Constraint Satisfaction Search |
IJCAI
1989
14 years 11 months ago
1989
A constraint satisfaction problem, or CSP, can be reformulated as an integer linear programming problem. The reformulated problem can be solved via polynomial multiplication. If t...
AICOM
2004
14 years 9 months ago
2004
Abstract. Dechter et al. [5] proposed solving the Temporal Constraint Satisfaction Problem (TCSP) by modeling it as a metaCSP, which is a finite CSP with a unique global constraint...
ICPPW
2009
IEEE
14 years 7 months ago
2009
IEEE
In this paper we address the problem of global real-time periodic scheduling on heterogeneous multiprocessor platforms. We give a solution based on a constraint satisfaction proble...
CP
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Constraint satisfaction problems provide strong formalism for modeling variety of real life problems. This paper presents a work currently in progress of which the goal i...
AAAI
2007
15 years 1 days ago
2007
Solving logic puzzles has become a very popular past-time, particularly since the Sudoku puzzle started appearing in newspapers all over the world. We have developed a puzzle gene...