5580 search results - page 816 / 1116 » Randomized priority algorithms |
130
click to vote
COLT
2003
Springer
15 years 8 months ago
2003
Springer
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...
112
click to vote
EUROPAR
2003
Springer
15 years 8 months ago
2003
Springer
Recently, a server-less video-on-demand architecture has been proposed which can completely eliminate costly dedicated video servers and yet is highly scalable and reliable. Due to...
139
click to vote
IPSN
2003
Springer
15 years 8 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...
135
click to vote
DFT
1999
IEEE
15 years 7 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 ...
104
click to vote
FOCS
1998
IEEE
15 years 7 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...