12015 search results - page 508 / 2403 » Interactive Algorithms 2005 |
146
click to vote
STOC
2005
ACM
16 years 5 months ago
2005
ACM
In combinatorial optimization, a popular approach to NP-hard problems is the design of approximation algorithms. These algorithms typically run in polynomial time and are guarante...
131
Voted
ICRA
2005
IEEE
15 years 10 months ago
2005
IEEE
– We present a robust localization algorithm for mobile robots with laser range finders, which takes featurebased approach for reliable matching process as well as pointbased app...
169
Voted
ISPDC
2005
IEEE
15 years 10 months ago
2005
IEEE
Abstract— In this article, we propose a fully distributed algorithm for finding all primes in an given interval [2..n] (or (L, R), more generally), based on the SMER — Schedul...
120
click to vote
ATAL
2005
Springer
15 years 10 months ago
2005
Springer
Multi-agent problem domains may require distributed algorithms for a variety of reasons: local sensors, limitations of communication, and availability of distributed computational...
125
Voted
COCOON
2005
Springer
15 years 10 months ago
2005
Springer
Rocchio’s similarity-based relevance feedback algorithm, one of the most important query reformation methods in information retrieval, is essentially an adaptive supervised lear...