13841 search results - page 241 / 2769 » Algorithms and Constraint Programming |
189
click to vote
ANOR
2008
15 years 6 months ago
2008
This paper deals with the job-shop scheduling problem with sequencedependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The met...
176
click to vote
IPPS
2003
IEEE
15 years 12 months ago
2003
IEEE
As computing systems of all types grow in power and complexity, it is common to want to simultaneously execute processes with different timeliness constraints. Many systems use CP...
169
click to vote
HM
2009
Springer
15 years 11 months ago
2009
Springer
We present a hybrid solver (called GELATO) that exploits the potentiality of a Constraint Programming (CP) environment (Gecode) and of a Local Search (LS) framework (EasyLocal++ )....
142
click to vote
CP
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Invariants that incrementally maintain the value of expresder assignments to their variables are a natural abstraction to build high-level local search algorithms. But th...
195
click to vote
ICCL
1998
IEEE
15 years 11 months ago
1998
IEEE
An aggregate array computation is a loop that computes accumulated quantities over array elements. Such computations are common in programs that use arrays, and the array elements...