Sciweavers

5153 search results - page 476 / 1031
» Introduction to Randomized Algorithms
Sort
View
162
Voted
ICRA
2000
IEEE
117views Robotics» more  ICRA 2000»
15 years 10 months ago
Kinodynamic Motion Planning Amidst Moving Obstacles
This paper presents a randomized motion planner for kinodynamic asteroidavoidanceproblems, in which a robot must avoid collision with moving obstacles under kinematic, dynamic con...
Robert Kindel, David Hsu, Jean-Claude Latombe, Ste...
ICS
2010
Tsinghua U.
15 years 10 months ago
Bounds on the Quantum Satisfiability Threshold
Quantum k-SAT is the problem of deciding whether there is a n-qubit state which is perpendicular to a set of vectors, each of which lies in the Hilbert space of k qubits. Equivale...
Sergey Bravyi, Cristopher Moore, Alexander Russell
ECAI
1994
Springer
15 years 10 months ago
The SAT Phase Transition
We describe a detailed experimental investigation of the phase transition for several different classes of randomly generated satisfiability problems. We observe a remarkable consi...
Ian P. Gent, Toby Walsh
180
Voted
DAC
2004
ACM
15 years 10 months ago
Probabilistic regression suites for functional verification
Random test generators are often used to create regression suites on-the-fly. Regression suites are commonly generated by choosing several specifications and generating a number o...
Shai Fine, Shmuel Ur, Avi Ziv
CRYPTO
2006
Springer
92views Cryptology» more  CRYPTO 2006»
15 years 10 months ago
Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs
In this paper we formalize a general model of cryptanalytic time/memory tradeoffs for the inversion of a random function f : {0, 1, . . . , N - 1} {0, 1, . . . , N - 1}. The model...
Elad Barkan, Eli Biham, Adi Shamir