97 search results - page 14 / 20 » Symmetry Breaking in Constraint Programming |
AAAI
2007
13 years 10 months ago
2007
In this paper, a state-based approach for the Constraint Satisfaction Problem (CSP) is proposed. The key novelty is an original use of state memorization during search to prevent ...
CPAIOR
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. The multiple knapsack problem (MKP) is a classical combinatorial optimization problem. A recent algorithm for some classes of the MKP is bin-completion, a bin-oriented, b...
CP
2005
Springer
14 years 1 months ago
2005
Springer
We introduce a novel and exciting research area: symmetrising levels of consistency to produce stronger forms of consistency and more efficient mechanisms for establishing them. W...
CPAIOR
2005
Springer
14 years 1 months ago
2005
Springer
The Employee Timetabling Problem (ETP) is a general class of problems widely encountered in service organizations (such as call centers for instance). Given a set of activities, a ...
ICCV
2005
IEEE
14 years 9 months ago
2005
IEEE
The goal of this work is to recover human body configurations from static images. Without assuming a priori knowledge of scale, pose or appearance, this problem is extremely chall...