Sciweavers

3396 search results - page 420 / 680
» Tree representations of graphs
Sort
View
194
Voted
SAC
2009
ACM
15 years 11 months ago
Autonomous networked robots for the establishment of wireless communication in uncertain emergency response scenarios
During a disaster, emergency response operations can benefit from the establishment of a wireless ad hoc network. We propose the use of autonomous robots that move inside a disas...
Stelios Timotheou, Georgios Loukas
HICSS
2000
IEEE
136views Biometrics» more  HICSS 2000»
15 years 11 months ago
Ordered End-to-End Multicast for Distributed Multimedia Systems
We address the problem of message ordering for reliable multicast communication. End-to-end multicast ordering is useful for ensuring the collective integrity and consistency of d...
Hans-Peter Dommel, J. J. Garcia-Luna-Aceves
ESA
1994
Springer
138views Algorithms» more  ESA 1994»
15 years 10 months ago
Efficient Construction of a Bounded Degree Spanner with Low Weight
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a graph having the points of S as its vertices such that for any pair p, q of points ther...
Sunil Arya, Michiel H. M. Smid
BIRTHDAY
2008
Springer
15 years 8 months ago
AND/OR Multi-valued Decision Diagrams for Constraint Networks
The paper is an overview of a recently developed compilation data structure for graphical models, with specific application to constraint networks. The AND/OR Multi-Valued Decision...
Robert Mateescu, Rina Dechter
DIALM
2008
ACM
135views Algorithms» more  DIALM 2008»
15 years 8 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