874 search results - page 46 / 175 » Optimal Scheduling of Contract Algorithms for Anytime Proble... |
151
click to vote
CAAN
2006
Springer
15 years 7 months ago
2006
Springer
In this paper we improve the quality of a recently suggested class of construction heuristics for the Asymmetric Traveling Salesman Problem (ATSP), namely the Contract-or-Patch heu...
114
click to vote
ISAAC
2001
Springer
15 years 8 months ago
2001
Springer
We consider a problem faced by train companies: How can trains be assigned to satisfy scheduled routes in a cost efficient way? Currently, many railway companies create solutions b...
129
Voted
CP
2003
Springer
15 years 9 months ago
2003
Springer
This work introduces a combinatorial optimization problem called Mars Express Memory Dumping Problem (Mex-Mdp), which arises in the European Space Agency program Mars Express. It c...
125
Voted
VLDB
1997
ACM
15 years 8 months ago
1997
ACM
Scheduling query execution plans is a particularly complex problem in hierarchical parallel systems, where each site consists of a collection of local time-shared (e.g., CPU(s) or...
175
click to vote
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
In this paper, a novel approach for designing chromosome has been proposed to improve the effectiveness, which called multistage operation-based genetic algorithm (moGA). The obje...