Sciweavers

2479 search results - page 218 / 496
» Random Event Structures
Sort
View
WEA
2007
Springer
104views Algorithms» more  WEA 2007»
16 years 19 days ago
Dynamic Trees in Practice
Dynamic tree data structures maintain forests that change over time through edge insertions and deletions. Besides maintaining connectivity information in logarithmic time, they ca...
Robert Endre Tarjan, Renato Fonseca F. Werneck
IROS
2006
IEEE
105views Robotics» more  IROS 2006»
16 years 17 days ago
Combinatorial Optimization of Sensing for Rule-Based Planar Distributed Assembly
Abstract— We describe a model for planar distributed assembly, in which agents move randomly and independently on a twodimensional grid, joining square blocks together to form a ...
Jonathan Kelly, Hong Zhang
CCCG
2008
15 years 8 months ago
Achieving Spatial Adaptivity while Finding Approximate Nearest Neighbors
We present the first spatially adaptive data structure that answers approximate nearest neighbor (ANN) queries to points that reside in a geometric space of any constant dimension...
Jonathan Derryberry, Don Sheehy, Maverick Woo, Dan...
PERCOM
2004
ACM
16 years 6 months ago
An Adaptive Approach to Content-Based Subscription in Mobile Ad Hoc Networks
We describe a novel approach for content-based publish/subscribe system in mobile ad-hoc networks and show preliminary experiment results. We extended ODMRP (OnDemand Multicast Rou...
Eiko Yoneki, Jean Bacon
MFCS
2005
Springer
16 years 1 days ago
Concurrent Automata vs. Asynchronous Systems
We compare the expressive power of two automata-based finite-state models of concurrency. We show that Droste’s and Kuske’s coherent stably concurrent automata and Bednarczyk...
Rémi Morin