Sciweavers

710 search results - page 89 / 142
» On Minimum Power Connectivity Problems
Sort
View
COMSWARE
2007
IEEE
14 years 4 months ago
Survivable Routing in WDM Weighted Networks
: In this paper, we investigate the problem of routing lightpaths on an arbitrary physical topology following a Design Protection approach, such that virtual topology remains conne...
Debasis Mandal, Satyajit Nath, Bivas Mitra
WADS
2007
Springer
68views Algorithms» more  WADS 2007»
14 years 4 months ago
On Euclidean Vehicle Routing with Allocation
The (Euclidean) Vehicle Routing Allocation Problem (VRAP) is a generalization of Euclidean TSP. We do not require that all points lie on the salesman tour. However, points that do ...
Jan Remy, Reto Spöhel, Andreas Weißl
GLOBECOM
2006
IEEE
14 years 4 months ago
Distributed Formation of Overlapping Multi-hop Clusters in Wireless Sensor Networks
– Clustering is a standard approach for achieving efficient and scalable performance in wireless sensor networks. Most of the published clustering algorithms strive to generate t...
Adel M. Youssef, Mohamed F. Younis, Moustafa Youss...
CPM
2000
Springer
105views Combinatorics» more  CPM 2000»
14 years 2 months ago
Structural Properties and Tractability Results for Linear Synteny
The syntenic dista nce between two species is the minimum number of fusions, fissions, and translocations required to transform one genome into the other. The linear syntenic dis...
David Liben-Nowell, Jon M. Kleinberg
DSN
2008
IEEE
14 years 4 months ago
Automatic security assessment of critical cyber-infrastructures
This research investigates the automation of security assessment of the static and dynamic properties of cyberinfrastructures, with emphasis on the electrical power grid. We descr...
Zahid Anwar, Ravinder Shankesi, Roy H. Campbell