Sciweavers

84 search results - page 10 / 17
» Distributed search in railway scheduling problems
Sort
View
RTSS
1992
IEEE
15 years 3 months ago
Allocation of periodic task modules with precedence and deadline constraints in distributed real-time systems
This paper addresses the problem of allocating (assigning and scheduling) periodic task modules to processing nodes in distributed real-time systems subject to task precedence and ...
Chao-Ju Hou, Kang G. Shin
AISC
2008
Springer
15 years 1 months ago
Strategies for Solving SAT in Grids by Randomized Search
Grid computing offers a promising approach to solving challenging computational problems in an environment consisting of a large number of easily accessible resources. In this pape...
Antti Eero Johannes Hyvärinen, Tommi A. Juntt...
JAIR
2007
141views more  JAIR 2007»
14 years 11 months ago
Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
Alex S. Fukunaga, Richard E. Korf
APPROX
2007
Springer
137views Algorithms» more  APPROX 2007»
15 years 6 months ago
A Knapsack Secretary Problem with Applications
We consider situations in which a decision-maker with a fixed budget faces a sequence of options, each with a cost and a value, and must select a subset of them online so as to ma...
Moshe Babaioff, Nicole Immorlica, David Kempe, Rob...
CLEIEJ
2004
119views more  CLEIEJ 2004»
14 years 11 months ago
Pump Scheduling Optimization Using Asynchronous Parallel
Optimizing the pump-scheduling is an interesting proposal to achieve cost reductions in water distribution pumping stations. As systems grow, pump-scheduling becomes a very diffic...
Christian von Lücken, Benjamín Bar&aac...