442 search results - page 34 / 89 » Discovering Heuristic Strategy for Solving Scheduling Proble... |
130
click to vote
MIDDLEWARE
2007
Springer
15 years 10 months ago
2007
Springer
Many wireless sensor network protocols are employing gossipbased message dissemination, where nodes probabilistically forward messages, to reduce message overhead. We are concerne...
CP
2009
Springer
15 years 10 months ago
2009
Springer
This paper describes a new approach for solving disjunctive temporal problems such as the open shop and job shop scheduling domains. Much previous research in systematic search app...
175
click to vote
GECCO
2009
Springer
15 years 1 months ago
2009
Springer
This paper describes a general scheme to convert sequential ant-based algorithms into parallel shared memory algorithms. The scheme is applied to an ant-based algorithm for the ma...
128
click to vote
AIPS
2007
15 years 6 months ago
2007
Decomposition has proved an effective strategy in planning, with one decomposition-based planner, SGPLAN, exhibiting strong performance in the last two IPCs. By decomposing planni...
129
click to vote
EOR
2006
15 years 3 months ago
2006
The subject of this paper is the formulation and solution of a variation of the classical binary knapsack problem. The variation that is addressed is termed the ``fixed-charge kna...