Sciweavers

5138 search results - page 500 / 1028
» Randomized Algorithms for 3-SAT
Sort
View
ICRA
2003
IEEE
116views Robotics» more  ICRA 2003»
16 years 6 days ago
Linear time vehicle relocation in SLAM
Abstract— In this paper we propose an algorithm to determine the location of a vehicle in an environment represented by a stochastic map, given a set of environment measurements ...
José Neira, Juan D. Tardós, Jos&eacu...
COCO
1994
Springer
102views Algorithms» more  COCO 1994»
15 years 11 months ago
Alternation in Interaction
We study competing-prover one-round interactive proof systems. We show that one-round proof systems in which the rst prover is trying to convince a veri er to accept and the secon...
Marcos A. Kiwi, Carsten Lund, Alexander Russell, D...
FUN
2007
Springer
82views Algorithms» more  FUN 2007»
15 years 10 months ago
The Worst Page-Replacement Policy
In this paper, we consider the question: what is the worst possible page-replacement strategy? Our goal is to devise an online strategy that has the highest possible fraction of mi...
Kunal Agrawal, Michael A. Bender, Jeremy T. Finema...
APPROX
2006
Springer
91views Algorithms» more  APPROX 2006»
15 years 10 months ago
Threshold Functions for Asymmetric Ramsey Properties Involving Cliques
Consider the following problem: For given graphs G and F1, . . . , Fk, find a coloring of the edges of G with k colors such that G does not contain Fi in color i. For example, if e...
Martin Marciniszyn, Jozef Skokan, Reto Spöhel...
ESA
2006
Springer
106views Algorithms» more  ESA 2006»
15 years 10 months ago
Less Hashing, Same Performance: Building a Better Bloom Filter
A standard technique from the hashing literature is to use two hash functions h1(x) and h2(x) to simulate additional hash functions of the form gi(x) = h1(x) + ih2(x). We demonstra...
Adam Kirsch, Michael Mitzenmacher