592 search results - page 21 / 119 » Using Constraint Programming to Solve the Maximum Clique Pro... |
118
Voted
CP
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. We present a cooperation technique using an accurate management of nogoods to solve a hard real-time problem which consists in assigning periodic tasks to processors in t...
128
Voted
EOR
2010
15 years 2 months ago
2010
We consider the unrelated parallel machines scheduling problem where jobs have earliness and tardiness penalties and a common due date. We formulate this problem and some of its v...
114
Voted
ANTSW
2008
Springer
15 years 4 months ago
2008
Springer
We propose to integrate ACO in a Constraint Programming (CP) language. Basically, we use the CP language to describe the problem to solve by means of constraints and we use the CP ...
120
click to vote
AICCSA
2006
IEEE
15 years 8 months ago
2006
IEEE
: The past decade witnessed rapid development of constraint satisfaction technologies, where algorithms are now able to cope with larger and harder problems. However, owing to the ...
118
Voted
EVOW
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. Bucket elimination (BE) is an exact technique based on variable elimination, commonly used for solving constraint satisfaction problems. We consider the hybridization of ...