Sciweavers

867 search results - page 129 / 174
» On Optimization of Test Parallelization with Constraints
Sort
View
SCP
1998
107views more  SCP 1998»
15 years 2 months ago
A Distributed Arc-Consistency Algorithm
Consistency techniques are an e cient way of tackling constraint satisfaction problems (CSP). In particular, various arc-consistency algorithms have been designed such as the time...
T. Nguyen, Yves Deville
IPPS
2006
IEEE
15 years 9 months ago
A probabilistic approach for fault tolerant multiprocessor real-time scheduling
In this paper we tackle the problem of scheduling a periodic real-time system on identical multiprocessor platforms, moreover the tasks considered may fail with a given probabilit...
Vandy Berten, Joël Goossens, Emmanuel Jeannot
SPAA
2003
ACM
15 years 8 months ago
The load rebalancing problem
In the classical load balancing or multiprocessor scheduling problem, we are given a sequence of jobs of varying sizes and are asked to assign each job to one of the m empty proce...
Gagan Aggarwal, Rajeev Motwani, An Zhu
IPPS
2000
IEEE
15 years 7 months ago
Switch Scheduling in the Multimedia Router (MMR)
The primary goal of the Multimedia Router (MMR) project is the design and implementation of a router optimized for multimedia applications. The router is targeted for use in clust...
Damon S. Love, Sudhakar Yalamanchili, José ...
111
Voted
OL
2008
79views more  OL 2008»
15 years 2 months ago
A simpler and tighter redundant Klee-Minty construction
By introducing redundant Klee-Minty examples, we have previously shown that the central path can be bent along the edges of the Klee-Minty cubes, thus having 2n - 2 sharp turns in...
Eissa Nematollahi, Tamás Terlaky