Sciweavers

800 search results - page 24 / 160
» Understanding Algorithm Performance on an Oversubscribed Sch...
Sort
View
ICC
2008
IEEE
109views Communications» more  ICC 2008»
14 years 1 months ago
Wireless Scheduling Algorithms with O(1) Overhead for M-Hop Interference Model
Abstract—We develop a family of distributed wireless scheduling algorithms that requires only O(1) complexity for M-hop interference model, for any finite M. The recent technolo...
Yung Yi, Mung Chiang
JCIT
2007
174views more  JCIT 2007»
13 years 7 months ago
Scheduling of scientific workflows using Discrete PSO Algorithm for Grids
Grid computing systems utilize distributive owned and geographically dispersed resources for providing a wide variety of services for various applications. It is possible that the...
Shajulin Benedict V. Vasudevan
COLCOM
2005
IEEE
14 years 1 months ago
Scheduling algorithms for peer-to-peer collaborative file distribution
—Peer-to-Peer file sharing applications in the Internet, such as BitTorrent, Gnutella, etc., have been immensely popular. Prior research mainly focuses on peer and content discov...
Jonathan S. K. Chan, Victor O. K. Li, King-Shan Lu...
HCW
1998
IEEE
13 years 11 months ago
A Dynamic Matching and Scheduling Algorithm for Heterogeneous Computing Systems
A heterogeneous computing system provides a variety of different machines, orchestrated to perform an application whose subtasks have diverse execution requirements. The subtasks ...
Muthucumaru Maheswaran, Howard Jay Siegel
IJCAI
2003
13 years 8 months ago
Automated Generation of Understandable Contingency Plans
Markov decision processes (MDPs) and contingency planning (CP) are two widely used approaches to planning under uncertainty. MDPs are attractive because the model is extremely gen...
Max Horstmann, Shlomo Zilberstein