Sciweavers

155 search results - page 16 / 31
» A Comparison Between ACO Algorithms for the Set Covering Pro...
Sort
View
TACAS
2012
Springer
288views Algorithms» more  TACAS 2012»
12 years 2 months ago
Reduction-Based Formal Analysis of BGP Instances
Today’s Internet interdomain routing protocol, the Border Gateway Protocol (BGP), is increasingly complicated and fragile due to policy misconfigurations by individual autonomou...
Anduo Wang, Carolyn L. Talcott, Alexander J. T. Gu...
PODC
2005
ACM
14 years 8 days ago
Facility location: distributed approximation
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...
Thomas Moscibroda, Roger Wattenhofer
ICALP
2005
Springer
14 years 7 days ago
Computational Bounds on Hierarchical Data Processing with Applications to Information Security
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
Roberto Tamassia, Nikos Triandopoulos
GECCO
2007
Springer
156views Optimization» more  GECCO 2007»
14 years 27 days ago
Techniques for highly multiobjective optimisation: some nondominated points are better than others
The research area of evolutionary multiobjective optimization (EMO) is reaching better understandings of the properties and capabilities of EMO algorithms, and accumulating much e...
David W. Corne, Joshua D. Knowles
ICDCS
2010
IEEE
13 years 8 months ago
Minimizing Probing Cost and Achieving Identifiability in Network Link Monitoring
Continuously monitoring the link performance is important to network diagnosis. Recently, active probes sent between end systems are widely used to monitor the link performance. I...
Qiang Zheng, Guohong Cao