Sciweavers

3820 search results - page 477 / 764
» Bounded Model Debugging
Sort
View
132
Voted
COMPGEOM
2006
ACM
15 years 9 months ago
Algorithms for two-box covering
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
Esther M. Arkin, Gill Barequet, Joseph S. B. Mitch...
131
Voted
INFOCOM
2005
IEEE
15 years 9 months ago
Distributed algorithms for secure multipath routing
— To proactively defend against intruders from readily jeopardizing single-path data sessions, we propose a distributed secure multipath solution to route data across multiple pa...
Patrick P. C. Lee, Vishal Misra, Dan Rubenstein
134
Voted
SWAT
2004
Springer
153views Algorithms» more  SWAT 2004»
15 years 9 months ago
Melding Priority Queues
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup,...
106
Voted
PODC
2003
ACM
15 years 9 months ago
Asynchronous resource discovery
Consider a dynamic, large-scale communication infrastructure (e.g., the Internet) where nodes (e.g., in a peer to peer system) can communicate only with nodes whose id (e.g., IP a...
Ittai Abraham, Danny Dolev
142
Voted
ESA
2003
Springer
116views Algorithms» more  ESA 2003»
15 years 8 months ago
Smoothed Motion Complexity
We propose a new complexity measure for movement of objects, the smoothed motion complexity. Many applications are based on algorithms dealing with moving objects, but usually data...
Valentina Damerow, Friedhelm Meyer auf der Heide, ...