Sciweavers

1388 search results - page 76 / 278
» Approximability of Robust Network Design
Sort
View
NOMS
2006
IEEE
105views Communications» more  NOMS 2006»
14 years 3 months ago
Adaptive Flow Aggregation - A New Solution for Robust Flow Monitoring under Security Attacks
— Flow-level traffic measurement is required for a wide range of applications including accounting, network planning and security management. A key design challenge is how to gr...
Yan Hu, Dah-Ming Chiu, John C. S. Lui
DAC
2010
ACM
13 years 9 months ago
Parallel multigrid preconditioning on graphics processing units (GPUs) for robust power grid analysis
Leveraging the power of nowadays graphics processing units for robust power grid simulation remains a challenging task. Existing preconditioned iterative methods that require inco...
Zhuo Feng, Zhiyu Zeng
GECCO
2003
Springer
129views Optimization» more  GECCO 2003»
14 years 2 months ago
Inherent Fault Tolerance in Evolved Sorting Networks
This poster paper summarizes our research on fault tolerance arising as a by-product of the evolutionary computation process. Past research has shown evidence of robustness emergin...
Rob Shepherd, James A. Foster
LATIN
2010
Springer
14 years 2 months ago
Prize-Collecting Steiner Networks via Iterative Rounding
In this paper we design an iterative rounding approach for the classic prize-collecting Steiner forest problem and more generally the prize-collecting survivable Steiner network de...
MohammadTaghi Hajiaghayi, Arefeh A. Nasri
MOBIHOC
2008
ACM
14 years 9 months ago
Self-monitoring for sensor networks
Local monitoring is an effective mechanism for the security of wireless sensor networks (WSNs). Existing schemes assume the existence of sufficient number of active nodes to carry...
Dezun Dong, Yunhao Liu, Xiangke Liao