16 search results - page 1 / 4 » When Structures Are Almost Surely Connected |
COMBINATORICS
2000
13 years 10 months ago
2000
Let An denote the number of objects of some type of "size" n, and let Cn denote the number of these objects which are connected. It is often the case that there is a rel...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
NPIV
1999
ACM
14 years 3 months ago
1999
ACM
We built a tool to visualize and explore program execution traces. Our goal was to help programmers without any prior knowledge of a program, quickly get enough knowledge about it...
JGT
2007
13 years 10 months ago
2007
Laman’s characterization of minimally rigid 2-dimensional generic frameworks gives a matroid structure on the edge set of the underlying graph, as was first pointed out and expl...
AUTOMATICA
2011
13 years 5 months ago
2011
Iterative distributed algorithms are studied for computing arithmetic averages over networks of agents connected through memoryless broadcast erasure channels. These algorithms do...