Sciweavers

2191 search results - page 271 / 439
» Improving the Efficiency of Non-Deterministic Computations
Sort
View
AIPS
2004
13 years 11 months ago
Guiding Planner Backjumping Using Verifier Traces
In this paper, we show how a planner can use a modelchecking verifier to guide state space search. In our work on hard real-time, closed-loop planning, we use a modelchecker'...
Robert P. Goldman, Michael J. S. Pelican, David J....
SODA
2001
ACM
105views Algorithms» more  SODA 2001»
13 years 11 months ago
Online point location in planar arrangements and its applications
Recently, Har-Peled [HP99b] presented a new randomized technique for online construction of the zone of a curve in a planar arrangement of arcs. In this paper, we present several ...
Sariel Har-Peled, Micha Sharir
MOBICOM
2010
ACM
13 years 10 months ago
Side channel: bits over interference
Interference is a critical issue in wireless communications. In a typical multiple-user environment, different users may severely interfere with each other. Coordination among use...
Kaishun Wu, Haoyu Tan, Yunhuai Liu, Jin Zhang, Qia...
DC
2010
13 years 9 months ago
Distributed algorithms for ultrasparse spanners and linear size skeletons
We present efficient algorithms for computing very sparse low distortion spanners in distributed networks and prove some non-trivial lower bounds on the tradeoff between time, spar...
Seth Pettie
FGCS
2006
87views more  FGCS 2006»
13 years 9 months ago
Task distribution with a random overlay network
We consider a model where commodity service providers are offering commodity computational services to a set of customers. We provide a solution for the efficient distribution of ...
Ladislau Bölöni, Damla Turgut, Dan C. Ma...