Sciweavers

1719 search results - page 88 / 344
» Scheduling with soft constraints
Sort
View
IPPS
2010
IEEE
13 years 8 months ago
Varying bandwidth resource allocation problem with bag constraints
We consider the problem of scheduling jobs on a pool of machines. Each job requires multiple machines on which it executes in parallel. For each job, the input specifies release ti...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Yogi...
EMSOFT
2001
Springer
14 years 2 months ago
Rate-Based Resource Allocation Models for Embedded Systems
: Run-time executives and operating system kernels for embedded systems have long relied exclusively on static priority scheduling of tasks to ensure timing constraints and other c...
Kevin Jeffay, Steve Goddard
DM
2000
103views more  DM 2000»
13 years 9 months ago
Feasible edge colorings of trees with cardinality constraints
A variation of preemptive open shop scheduling corresponds to
Dominique de Werra, Alain Hertz, Daniel Kobler, Na...
ICC
2008
IEEE
118views Communications» more  ICC 2008»
14 years 4 months ago
A Distributed Scheduling Algorithm for an Optical Switching Fabric
— Designing switching architectures for network routers and switches needs to consider limits imposed by the electronic technology, like small bandwidth×distance factors, power ...
Andrea Bianco, Elisabetta Carta, Davide Cuda, Jorg...
IJCAI
2003
13 years 11 months ago
In the quest of the best form of local consistency for Weighted CSP
The weighted CSP (WCSP) framework is a soft constraint framework with a wide range of applications. In this paper, we consider the problem of maintaining local consistency during ...
Javier Larrosa, Thomas Schiex