633 search results - page 38 / 127 » Locality and Hard SAT-Instances |
205
click to vote
MOBICOM
2004
ACM
15 years 11 months ago
2004
ACM
We demonstrate a system built using probabilistic techniques that allows for remarkably accurate localization across our entire office building using nothing more than the built-...
207
click to vote
DIALM
2003
ACM
15 years 11 months ago
2003
ACM
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...
142
click to vote
LADC
2005
Springer
15 years 11 months ago
2005
Springer
We present a framework for building fail-safe hard real-time applications in timed asynchronous distributed systems subject to communication partitions and performance, omission, ...
160
click to vote
AAAI
2000
15 years 7 months ago
2000
A major difficulty in evaluating incomplete local search style algorithms for constraint satisfaction problems is the need for a source of hard problem instances that are guarante...
164
click to vote
COMPGEOM
2004
ACM
15 years 11 months ago
2004
ACM
A geometric graph is a simple graph G = (V, E) with an embedding of the set V in the plane such that the points that represent V are in general position. A geometric graph is said...