Sciweavers

613 search results - page 87 / 123
» Time Optimal Self-Stabilizing Spanning Tree Algorithms
Sort
View
IPPS
2003
IEEE
15 years 3 months ago
Phylogenetic Tree Inference on PC Architectures with AxML/PAxML
Inference of phylogenetic trees comprising hundreds or even thousands of organisms based on the maximum likelihood method is computationally extremely expensive. In previous work,...
Alexandros Stamatakis, Thomas Ludwig 0002
ESA
2008
Springer
108views Algorithms» more  ESA 2008»
14 years 11 months ago
Two-Stage Robust Network Design with Exponential Scenarios
Abstract. We study two-stage robust variants of combinatorial optimization problems like Steiner tree, Steiner forest, and uncapacitated facility location. The robust optimization ...
Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni, ...
WIOPT
2010
IEEE
14 years 8 months ago
Lifetime optimization for wireless sensor networks with correlated data gathering
—The nodes in wireless sensor networks often collect correlated measurements. Not taking into account this information redundancy is detrimental to the network lifetime, since co...
Nashat Abughalieh, Yann-Aël Le Borgne, Kris S...
IFL
1997
Springer
136views Formal Methods» more  IFL 1997»
15 years 1 months ago
Fully Persistent Graphs - Which One To Choose?
Functional programs, by nature, operate on functional, or persistent, data structures. Therefore, persistent graphs are a prerequisite to express functional graph algorithms. In th...
Martin Erwig
DMTCS
2010
146views Mathematics» more  DMTCS 2010»
14 years 7 months ago
Tight Bounds for Delay-Sensitive Aggregation
This paper studies the fundamental trade-off between communication cost and delay cost arising in various contexts such as control message aggregation or organization theory. An o...
Yvonne Anne Pignolet, Stefan Schmid, Roger Wattenh...