10608 search results - page 496 / 2122 » Complexity of O'Hara's Algorithm |
167
click to vote
ICRA
2006
IEEE
16 years 1 months ago
2006
IEEE
— This paper presents a comparative analysis relative to the experimental performances of an asymptotically fast and incremental algorithm, recently developed to compute collisio...
255
click to vote
SENSYS
2006
ACM
16 years 29 days ago
2006
ACM
We explore fundamental performance limits of tracking a target in a two-dimensional field of binary proximity sensors, and design algorithms that attain those limits. In particul...
168
click to vote
SIGECOM
2006
ACM
16 years 29 days ago
2006
ACM
We present approximation and online algorithms for a number of problems of pricing items for sale so as to maximize seller’s revenue in an unlimited supply setting. Our first r...
192
click to vote
ISPD
2005
ACM
16 years 17 days ago
2005
ACM
In the nanometer VLSI technology, the variation effects like manufacturing variation, power supply noise, temperature etc. become very significant. As one of the most vital nets...
175
click to vote
ICALP
2003
Springer
16 years 6 days ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...