Sciweavers

475 search results - page 52 / 95
» Feasible distributed CSP models for scheduling problems
Sort
View
HPDC
1998
IEEE
15 years 8 months ago
Matchmaking: Distributed Resource Management for High Throughput Computing
Conventional resource management systems use a system model to describe resources and a centralized scheduler to control their allocation. We argue that this paradigm does not ada...
Rajesh Raman, Miron Livny, Marvin H. Solomon
MMM
2007
Springer
127views Multimedia» more  MMM 2007»
15 years 10 months ago
Optimizing the Throughput of Data-Driven Based Streaming in Heterogeneous Overlay Network
Recently, much attention has been paid on data-driven (or swarm-like) based live streaming systems due to its rapid growth in deployment over Internet. In such systems, nodes rando...
Meng Zhang, Chunxiao Chen, Yongqiang Xiong, Qian Z...
PPSN
2004
Springer
15 years 9 months ago
Learning Probabilistic Tree Grammars for Genetic Programming
Genetic Programming (GP) provides evolutionary methods for problems with tree representations. A recent development in Genetic Algorithms (GAs) has led to principled algorithms cal...
Peter A. N. Bosman, Edwin D. de Jong
WADS
2007
Springer
96views Algorithms» more  WADS 2007»
15 years 10 months ago
Initializing Sensor Networks of Non-uniform Density in the Weak Sensor Model
Abstract. Assumptions about node density in the Sensor Networks literature are frequently too strong or too weak. Neither absolutely arbitrary nor uniform deployment seem feasible ...
Martin Farach-Colton, Miguel A. Mosteiro
TROB
2002
120views more  TROB 2002»
15 years 4 months ago
DPAC: an object-oriented distributed and parallel computing framework for manufacturing applications
Parallel and distributed computing infrastructure are increasingly being embraced in the context of manufacturing applications, including real-time scheduling. In this paper, we pr...
N. R. Srinivasa Raghavan, Tanmay Waghmare