Sciweavers

126 search results - page 11 / 26
» A Global Constraint for Total Weighted Completion Time
Sort
View
MOR
2008
169views more  MOR 2008»
14 years 11 months ago
The Flow Set with Partial Order
The flow set with partial order is a mixed-integer set described by a budget on total flow and a partial order on the arcs that may carry positive flow. This set is a common substr...
Alper Atamtürk, Muhong Zhang
ANOR
2011
214views more  ANOR 2011»
14 years 6 months ago
A hybrid constraint programming approach to the log-truck scheduling problem
Abstract. Scheduling problems in the forest industry have received significant attention in the recent years and have contributed many challenging applications for optimization te...
Nizar El Hachemi, Michel Gendreau, Louis-Martin Ro...
76
Voted
MICRO
1999
IEEE
110views Hardware» more  MICRO 1999»
15 years 4 months ago
Balance Scheduling: Weighting Branch Tradeoffs in Superblocks
Since there is generally insufficient instruction level parallelism within a single basic block, higher performance is achieved by speculatively scheduling operations in superbloc...
Alexandre E. Eichenberger, Waleed Meleis
EMMCVPR
2005
Springer
15 years 5 months ago
Spatio-temporal Prior Shape Constraint for Level Set Segmentation
Abstract. This paper exposes a novel formulation of prior shape constraint incorporation for the level set segmentation of objects from corrupted images. Applicable to variational ...
Timothée Bailloeul, Véronique Prinet...
MATES
2009
Springer
15 years 6 months ago
Concurrently Decomposable Constraint Systems
In constraint satisfaction, decomposition is a common technique to split a problem in a number of parts in such a way that the global solution can be efficiently assembled from th...
Cees Witteveen, Wiebe van der Hoek, Nico Roos