Sciweavers

3678 search results - page 130 / 736
» On the Stable Paths Problem
Sort
View
96
Voted
PERCOM
2007
ACM
16 years 12 days ago
Static Path Planning for Mobile Beacons to Localize Sensor Networks
In this paper, we study the static path planning problem with wireless sensor network localization as the primary objective. We consider a model in which sensors are assumed to be...
Rui Huang, Gergely V. Záruba
105
Voted
ESA
2006
Springer
111views Algorithms» more  ESA 2006»
15 years 4 months ago
Path Hitting in Acyclic Graphs
An instance of the path hitting problem consists of two families of paths, D and H, in a common undirected graph, where each path in H is associated with a non-negative cost. We r...
Ojas Parekh, Danny Segev
97
Voted
OSN
2008
83views more  OSN 2008»
15 years 23 days ago
Path selection in user-controlled circuit-switched optical networks
User-controlled circuit-switched optical networks are gaining popularity in an effort to fulfill the insatiable data transport needs of the online community. In this paper we cons...
Wojciech M. Golab, Raouf Boutaba
ICCAD
2006
IEEE
107views Hardware» more  ICCAD 2006»
15 years 9 months ago
Current path analysis for electrostatic discharge protection
The electrostatic discharge (ESD) problem has become a challenging reliability issue in nanometer circuit design. High voltages resulted from ESD might cause high current densitie...
Hung-Yi Liu, Chung-Wei Lin, Szu-Jui Chou, Wei-Ting...
ICCTA
2007
IEEE
15 years 7 months ago
Partially Dynamic Concurrent Update of Distributed Shortest Paths
We study the dynamic version of the distributed all-pairs shortest paths problem. Most of the solutions given in the literature for this problem work under the assumption that bef...
Gianlorenzo D'Angelo, Serafino Cicerone, Gabriele ...