388 search results - page 49 / 78 » A Mixed Closure-CSP Method to Solve Scheduling Problems |
153
Voted
DATE
2007
IEEE
15 years 11 months ago
2007
IEEE
We present a decomposition strategy to speed up constraint optimization for a representative multiprocessor scheduling problem. In the manner of Benders decomposition, our techniq...
153
click to vote
CLUSTER
2006
IEEE
15 years 11 months ago
2006
IEEE
The paper addresses the problem of matching and scheduling of DAG-structured application to both minimize the makespan and maximize the robustness in a heterogeneous computing sys...
159
click to vote
GECCO
2010
Springer
15 years 7 months ago
2010
Springer
Developing dispatching rules for manufacturing systems is a tedious process, which is time- and cost-consuming. Since there is no good general rule for different scenarios and ob...
166
click to vote
ICCAD
1999
IEEE
15 years 9 months ago
1999
IEEE
We consider the problem of finding an optimal clock schedule, i.e. optimal arrival times for clock signals at latches of a VLSI chip. We describe a general model which includes al...
151
click to vote
ATAL
2007
Springer
15 years 11 months ago
2007
Springer
This paper addresses the problem of identifying the value of information held by a teammate on a distributed, multi-agent team. It focuses on a distributed scheduling task in whic...