608 search results - page 18 / 122 » Random Systems with Complete Connections |
CORR
2010
Springer
13 years 9 months ago
2010
Springer
The random greedy algorithm for constructing a large partial Steiner-Triple-System is defined as follows. We begin with a complete graph on n vertices and proceed to remove the ed...
BMCBI
2010
13 years 9 months ago
2010
Background: One of the most challenging aspects of biomolecular systems is the understanding of the coevolution in and among the molecule(s). A complete, theoretical picture of th...
JAIR
2011
2011
Analyzing Search Topology Without Running Any Search: On the Connection Between Causal Graphs and h+
13 years 16 days ago
The ignoring delete lists relaxation is of paramount importance for both satisficing and optimal planning. In earlier work, it was observed that the optimal relaxation heuristic ...
CDC
2009
IEEE
14 years 2 months ago
2009
IEEE
— In this paper, we study the dynamics of a viral spreading process in random geometric graphs (RGG). The spreading of the viral process we consider in this paper is closely rela...
DAGM
2008
Springer
13 years 11 months ago
2008
Springer
Three-dimensional electron-microscopic image stacks with almost isotropic resolution allow, for the first time, to determine the complete connection matrix of parts of the brain. I...