Sciweavers

38 search results - page 4 / 8
» Leaving the Span
Sort
View
EOR
2006
110views more  EOR 2006»
13 years 8 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
IWPEC
2009
Springer
14 years 2 months ago
What Makes Equitable Connected Partition Easy
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...
Rosa Enciso, Michael R. Fellows, Jiong Guo, Iyad A...
INFOCOM
2009
IEEE
14 years 2 months ago
Hyperbolic Embedding and Routing for Dynamic Graphs
—We propose an embedding and routing scheme for arbitrary network connectivity graphs, based on greedy routing and utilizing virtual node coordinates. In dynamic multihop packet-...
Andrej Cvetkovski, Mark Crovella
FSTTCS
2005
Springer
14 years 1 months ago
Monitoring Stable Properties in Dynamic Peer-to-Peer Distributed Systems
Monitoring a distributed system to detect a stable property is an important problem with many applications. The problem is especially challenging for a dynamic distributed system b...
Sathya Peri, Neeraj Mittal
IPPS
2007
IEEE
14 years 2 months ago
A Model for Large Scale Self-Stabilization
We introduce a new model for distributed algorithms designed for large scale systems that need a low-overhead solution to allow the processes to communicate with each other. We as...
Thomas Hérault, Pierre Lemarinier, Olivier ...