633 search results - page 38 / 127 » Locality and Hard SAT-Instances |
MOBICOM
2004
ACM
14 years 3 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-...
DIALM
2003
ACM
14 years 3 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...
LADC
2005
Springer
14 years 3 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, ...
AAAI
2000
13 years 11 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...
COMPGEOM
2004
ACM
14 years 3 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...