Sciweavers

4865 search results - page 656 / 973
» The Complexity of Graph Connectivity
Sort
View
SIGCOMM
2004
ACM
15 years 10 months ago
Routing in a delay tolerant network
We formulate the delay-tolerant networking routing problem, where messages are to be moved end-to-end across a connectivity graph that is time-varying but whose dynamics may be kn...
Sushant Jain, Kevin R. Fall, Rabin K. Patra
CPM
2004
Springer
84views Combinatorics» more  CPM 2004»
15 years 10 months ago
Small Phylogeny Problem: Character Evolution Trees
Abstract. Phylogenetics is a science of determining connections between groups of organisms in terms of ancestor/descendent relationships, usually expressed by phylogenetic trees, ...
Arvind Gupta, Ján Manuch, Ladislav Stacho, ...
GECCO
2004
Springer
15 years 10 months ago
Real-Coded Bayesian Optimization Algorithm: Bringing the Strength of BOA into the Continuous World
This paper describes a continuous estimation of distribution algorithm (EDA) to solve decomposable, real-valued optimization problems quickly, accurately, and reliably. This is the...
Chang Wook Ahn, Rudrapatna S. Ramakrishna, David E...
VLDB
2004
ACM
143views Database» more  VLDB 2004»
15 years 10 months ago
GPX: Interactive Mining of Gene Expression Data
Discovering co-expressed genes and coherent expression patterns in gene expression data is an important data analysis task in bioinformatics research and biomedical applications. ...
Daxin Jiang, Jian Pei, Aidong Zhang
INFOCOM
2003
IEEE
15 years 10 months ago
Localized minimum-energy broadcasting in ad-hoc networks
— In the minimum energy broadcasting problem, each node can adjust its transmission power in order to minimize total energy consumption but still enable a message originated from...
Julien Cartigny, David Simplot, Ivan Stojmenovic