Sciweavers

501 search results - page 66 / 101
» Scheduling Abstractions for Local Search
Sort
View
107
Voted
EUROPAR
2006
Springer
15 years 7 months 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...
141
Voted
CP
2009
Springer
15 years 10 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...
119
Voted
EVOW
2009
Springer
15 years 10 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»
15 years 10 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...
103
Voted
CEC
2005
IEEE
15 years 9 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