Sciweavers

1174 search results - page 125 / 235
» Functional Trees
Sort
View
DSOM
2005
Springer
15 years 8 months ago
Decentralized Computation of Threshold Crossing Alerts
Threshold crossing alerts (TCAs) indicate to a management system that a management variable, associated with the state, performance or health of the network, has crossed a certain ...
Fetahi Wuhib, Mads Dam, Rolf Stadler, Alexander Cl...
107
Voted
DIALM
2008
ACM
135views Algorithms» more  DIALM 2008»
15 years 4 months ago
Symmetric range assignment with disjoint MST constraints
If V is a set of n points in the unit square [0, 1]2 , and if R : V + is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: {v, w}...
Eric Schmutz
115
Voted
PDPTA
2003
15 years 3 months ago
Managing Flocking Objects with an Octree Spanning a Parallel Message-Passing Computer Cluster
We investigate the management of flocking mobile objects using a parallel message-passing computer cluster. An octree, a data structure well-known for use in managing a 3D space, ...
Thomas E. Portegys, Kevin M. Greenan
116
Voted
CORR
2010
Springer
134views Education» more  CORR 2010»
15 years 2 months ago
Incremental Sampling-based Algorithms for Optimal Motion Planning
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...
Sertac Karaman, Emilio Frazzoli
SIAMDM
2008
139views more  SIAMDM 2008»
15 years 2 months ago
Approximate Integer Decompositions for Undirected Network Design Problems
A well-known theorem of Nash-Williams and Tutte gives a necessary and sufficient condition for the existence of k edge-disjoint spanning trees in an undirected graph. A corollary o...
Chandra Chekuri, F. Bruce Shepherd