6393 search results - page 981 / 1279 » Randomized Algorithms on the Mesh |
152
click to vote
IPSN
2003
Springer
15 years 10 months ago
2003
Springer
Abstract. We demonstrate that it is possible to achieve accurate localization and tracking of a target in a randomly placed wireless sensor network composed of inexpensive componen...
150
click to vote
DFT
1999
IEEE
15 years 9 months ago
1999
IEEE
In this paper, we present a memory fault simulator called the Random Access Memory Simulator for Error Screening (RAMSES). Although it was designed based on some wellknown memory ...
125
click to vote
FOCS
1998
IEEE
15 years 9 months ago
1998
IEEE
In the Finite Capacity Dial-a-Ride problem the input is a metric space, a set of objects {di}, each specifying a source si and a destination ti, and an integer k--the capacity of t...
140
click to vote
AI
1998
Springer
15 years 9 months ago
1998
Springer
Abstract. The general timetabling problem is an assignment of activities to xed time intervals, adhering to a prede ned set of resource availabilities. Timetabling problems are di ...
157
click to vote
COCO
1998
Springer
15 years 9 months ago
1998
Springer
We show that the perfect matching problem is in the complexity class SPL in the nonuniform setting. This provides a better upper bound on the complexity of the matching problem, a...