187 search results - page 15 / 38 » Distributed Constraints for Large-Scale Scheduling Problems |
DFVLR
1987
13 years 11 months ago
1987
: This paper examines the argument for dataflow architectures in "Two Fundamental Issues in Multiprocessing[5]." We observe two key problems. First, the justification of ...
JPDC
2006
13 years 7 months ago
2006
We present provably efficient parallel algorithms for sweep scheduling, which is a commonly used technique in Radiation Transport problems, and involves inverting an operator by i...
CIA
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. In this paper we investigate methods for analyzing the expected value of adding information in distributed task scheduling problems. As scheduling problems are NP-complet...
AAAI
1994
13 years 9 months ago
1994
In this paper, we study the problem of achieving efficient interaction in a distributed scheduling system whose scheduling agents may borrow resources from one another. Specifical...
CP
1998
Springer
13 years 12 months ago
1998
Springer
The constraint paradigm provides powerful concepts to represent and solve different kinds of planning problems, e. g. factory scheduling. Factory scheduling is a demanding optimiz...