Sciweavers

219 search results - page 5 / 44
» Survivable network design with degree or order constraints
Sort
View
GECCO
2005
Springer
160views Optimization» more  GECCO 2005»
14 years 1 months ago
Designing resilient networks using a hybrid genetic algorithm approach
As high-speed networks have proliferated across the globe, their topologies have become sparser due to the increased capacity of communication media and cost considerations. Relia...
Abdullah Konak, Alice E. Smith
ICC
2008
IEEE
137views Communications» more  ICC 2008»
14 years 2 months ago
Reliability of Connections in Multilayer Networks under Shared Risk Groups and Costs Constraints
The notion of Shared Risk Resource Groups (SRRG) has been introduced to capture survivability issues when a set of resources may fail simultaneously. Applied to Wavelength Divisio...
David Coudert, Florian Huc, Fabrice Peix, Marie-Em...
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
14 years 24 days ago
Localized construction of bounded degree and planar spanner for wireless ad hoc networks
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...
Yu Wang 0003, Xiang-Yang Li
CVPR
2007
IEEE
14 years 9 months ago
Leveraging temporal, contextual and ordering constraints for recognizing complex activities in video
We present a scalable approach to recognizing and describing complex activities in video sequences. We are interested in long-term, sequential activities that may have several par...
Benjamin Laxton, Jongwoo Lim, David J. Kriegman
LATIN
2010
Springer
14 years 19 days 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