Sciweavers

460 search results - page 64 / 92
» Bounding the locality of distributed routing algorithms
Sort
View
HPDC
2002
IEEE
14 years 1 months ago
Decoupling Computation and Data Scheduling in Distributed Data-Intensive Applications
In high energy physics, bioinformatics, and other disciplines, we encounter applications involving numerous, loosely coupled jobs that both access and generate large data sets. So...
Kavitha Ranganathan, Ian T. Foster
INFOCOM
2007
IEEE
14 years 3 months ago
Low-Power Distributed Event Detection in Wireless Sensor Networks
Abstract—In this paper we address the problem of energyefficient event detection in wireless sensor networks (WSNs). Duty cycling is a fundamental approach to conserving energy i...
Yanmin Zhu, Yunhao Liu, Lionel M. Ni, Z. Zhang
EOR
2007
80views more  EOR 2007»
13 years 9 months ago
A partition approach to the inventory/routing problem
In this study we focus on the integration of inventory control and vehicle routing schedules for a distribution system in which the warehouse is responsible for the replenishment ...
Qiu-Hong Zhao, Shouyang Wang, Kin Keung Lai
IEEEPACT
1998
IEEE
14 years 1 months ago
Adaptive Scheduling of Computations and Communications on Distributed Memory Systems
Compile-time scheduling is one approach to extract parallelism which has proved effective when the execution behavior is predictable. Unfortunately, the performance of most priori...
Mayez A. Al-Mouhamed, Homam Najjari
ICASSP
2011
IEEE
13 years 21 days ago
A combinatorial optimization framework for subset selection in distributed multiple-radar architectures
Abstract—Widely distributed multiple radar architectures offer parameter estimation improvement for target localization. For a large number of radars, the achievable localization...
Hana Godrich, Athina P. Petropulu, H. Vincent Poor