Sciweavers

140 search results - page 14 / 28
» Computing Minimum Spanning Trees with Uncertainty
Sort
View
WINET
2010
128views more  WINET 2010»
14 years 10 months ago
Distributed algorithms for lifetime maximization in sensor networks via Min-Max spanning subgraphs
We consider the problem of static transmission-power assignment for lifetime maximization of a wireless sensor network with stationary nodes operating in a data-gathering scenario...
Harri Haanpää, André Schumacher, ...
GAMESEC
2010
139views Game Theory» more  GAMESEC 2010»
14 years 9 months ago
Design of Network Topology in an Adversarial Environment
We study the strategic interaction between a network manager whose goal is to choose (as communication infrastructure) a spanning tree of a network given as an undirected graph, an...
Assane Gueye, Jean C. Walrand, Venkat Anantharam
HPCC
2007
Springer
15 years 5 months ago
An Adaptive Parallel Hierarchical Clustering Algorithm
Clustering of data has numerous applications and has been studied extensively. It is very important in Bioinformatics and data mining. Though many parallel algorithms have been des...
Zhaopeng Li, Kenli Li, Degui Xiao, Lei Yang
ESA
1998
Springer
154views Algorithms» more  ESA 1998»
15 years 3 months ago
A Functional Approach to External Graph Algorithms
We present a new approach for designing external graph algorithms and use it to design simple, deterministic and randomized external algorithms for computing connected components, ...
James Abello, Adam L. Buchsbaum, Jeffery Westbrook
EOR
2006
110views more  EOR 2006»
14 years 11 months ago
Scatter search with path relinking for phylogenetic inference
We propose the use of scatter search with path relinking for the inference of phylogenetic trees. Solutions are here represented as trees whose leaves span the set of species unde...
Carlos Cotta