Sciweavers

501 search results - page 66 / 101
» Scheduling Abstractions for Local Search
Sort
View
EUROPAR
2006
Springer
14 years 4 days ago
Master-Slave Tasking on Asymmetric Networks
Abstract. This paper presents new techniques for master-slave tasking on treeshaped networks with fully heterogeneous communication and processing resources. A large number of inde...
Cyril Banino-Rokkones, Olivier Beaumont, Lasse Nat...
CP
2009
Springer
14 years 3 months ago
Why Cumulative Decomposition Is Not as Bad as It Sounds
Abstract. The global cumulative constraint was proposed for modelling cumulative resources in scheduling problems for finite domain (FD) propagation. Since that time a great deal ...
Andreas Schutt, Thibaut Feydy, Peter J. Stuckey, M...
EVOW
2009
Springer
14 years 3 months ago
University Course Timetabling with Genetic Algorithm: A Laboratory Excercises Case Study
Abstract. This paper describes the application of a hybrid genetic algorithm to a real-world instance of the university course timetabling problem. We address the timetabling of la...
Zlatko Bratkovic, Tomislav Herman, Vjera Omrcen, M...
WADS
2009
Springer
226views Algorithms» more  WADS 2009»
14 years 3 months ago
Integer Programming: Optimization and Evaluation Are Equivalent
Abstract We show that if one can find the optimal value of an integer programming problem min{cx : Ax ≥ b, x ∈ Zn +} in polynomial time, then one can find an optimal solution...
James B. Orlin, Abraham P. Punnen, Andreas S. Schu...
CEC
2005
IEEE
14 years 2 months ago
Evolving binary decision diagrams using implicit neutrality
Abstract- A new algorithm is presented for evolving Binary Decision Diagrams (BDD) that employs the neutrality implicit in the BDD representation. It is shown that an effortless ne...
Richard M. Downing