Sciweavers

2279 search results - page 332 / 456
» Distributed Spectrum-Efficient Routing Algorithms in Wireles...
Sort
View
FOCS
1997
IEEE
15 years 7 months ago
General Dynamic Routing with Per-Packet Delay Guarantees of O(distance + 1 / session rate)
A central issue in the design of modern communication networks is that of providing performance guarantees. This issue is particularly important if the networks support real-time t...
Matthew Andrews, Antonio Fernández, Mor Har...
ASPDAC
2009
ACM
115views Hardware» more  ASPDAC 2009»
15 years 10 months ago
Incremental and on-demand random walk for iterative power distribution network analysis
— Power distribution networks (PDNs) are designed and analyzed iteratively. Random walk is among the most efficient methods for PDN analysis. We develop in this paper an increme...
Yiyu Shi, Wei Yao, Jinjun Xiong, Lei He
130
Voted
DEBS
2008
ACM
15 years 5 months ago
Distributed automatic service composition in large-scale systems
Automatic service composition is an active research area in the field of service computing. This paper presents a distributed approach to automatically discover a composition of s...
Songlin Hu, Vinod Muthusamy, Guoli Li, Hans-Arno J...
133
Voted
DAC
1997
ACM
15 years 7 months ago
More Practical Bounded-Skew Clock Routing
: Academic clock routing research results has often had limited impact on industry practice, since such practical considerations as hierarchical buffering, rise-time and overshoot ...
Andrew B. Kahng, Chung-Wen Albert Tsao
EUROGP
2005
Springer
115views Optimization» more  EUROGP 2005»
15 years 9 months ago
Genetic Programming in Wireless Sensor Networks
Abstract. Wireless sensor networks (WSNs) are medium scale manifestations of a paintable or amorphous computing paradigm. WSNs are becoming increasingly important as they attain gr...
Derek M. Johnson, Ankur Teredesai, Robert T. Salta...