Sciweavers

3098 search results - page 482 / 620
» On distributed smooth scheduling
Sort
View
IOR
2002
135views more  IOR 2002»
15 years 5 months ago
A Fluid Heuristic for Minimizing Makespan in Job Shops
We describe a simple on-line heuristic for scheduling job-shops. We assume there is a fixed set of routes for the jobs, and many jobs, say N, on each route. The heuristic uses saf...
J. G. Dai, Gideon Weiss
SECON
2010
IEEE
15 years 3 months ago
Adaptive Instantiation of the Protocol Interference Model in Mission-Critical Wireless Networks
Interference model is the basis of MAC protocol design in wireless networks, and it directly affects the efficiency and predictability of wireless messaging. To exploit the strengt...
Xin Che, Xiaohui Liu, Xi Ju, Hongwei Zhang
ATAL
2011
Springer
14 years 5 months ago
A double oracle algorithm for zero-sum security games on graphs
In response to the Mumbai attacks of 2008, the Mumbai police have started to schedule a limited number of inspection checkpoints on the road network throughout the city. Algorithm...
Manish Jain, Dmytro Korzhyk, Ondrej Vanek, Vincent...
INFOCOM
2009
IEEE
16 years 17 days ago
Computing the Capacity Region of a Wireless Network
—We consider a wireless network of n nodes that communicate over a common wireless medium under some interference constraints. Our work is motivated by the need for an efficient...
Ramakrishna Gummadi, Kyomin Jung, Devavrat Shah, R...
IPPS
2008
IEEE
16 years 10 days ago
Large-scale experiment of co-allocation strategies for Peer-to-Peer supercomputing in P2P-MPI
High Performance computing generally involves some parallel applications to be deployed on the multiples resources used for the computation. The problem of scheduling the applicat...
Stéphane Genaud, Choopan Rattanapoka