Sciweavers

2497 search results - page 102 / 500
» Requirements for models of achievable routing
Sort
View
TCAD
2008
133views more  TCAD 2008»
15 years 1 months ago
Metal-Density-Driven Placement for CMP Variation and Routability
In this paper, we propose the first metal-density driven placement algorithm to reduce CMP variation and achieve higher routability. Based on an analytical placement framework, we...
Tung-Chieh Chen, Minsik Cho, David Z. Pan, Yao-Wen...
INFOCOM
2007
IEEE
15 years 8 months ago
Polynomial Complexity Algorithms for Full Utilization of Multi-Hop Wireless Networks
— In this paper, we propose and study a general framework that allows the development of distributed mechanisms to achieve full utilization of multi-hop wireless networks. In par...
Atilla Eryilmaz, Asuman E. Ozdaglar, Eytan Modiano
109
Voted
CORR
2008
Springer
130views Education» more  CORR 2008»
15 years 1 months ago
Multicast Capacity of Optical WDM Packet Ring for Hotspot Traffic
Packet-switching WDM ring networks with a hotspot transporting unicast, multicast, and broadcast trac are important components of high-speed metropolitan area networks. For an arbi...
Matthias an der Heiden, Michel Sortais, Michael Sc...
114
Voted
MOBISYS
2010
ACM
15 years 4 months ago
GreenGPS: a participatory sensing fuel-efficient maps application
This paper develops a navigation service, called GreenGPS, that uses participatory sensing data to map fuel consumption on city streets, allowing drivers to find the most fueleffi...
Raghu K. Ganti, Nam Pham, Hossein Ahmadi, Saurabh ...
134
Voted
EWSN
2004
Springer
16 years 1 months ago
ACE: An Emergent Algorithm for Highly Uniform Cluster Formation
The efficient subdivision of a sensor network into uniform, mostly non-overlapping clusters of physically close nodes is an important building block in the design of efficient uppe...
Haowen Chan, Adrian Perrig