Sciweavers

626 search results - page 45 / 126
» Satisfying Maintenance Goals
Sort
View
ICRA
2005
IEEE
125views Robotics» more  ICRA 2005»
14 years 2 months ago
Temporal Logic Motion Planning for Mobile Robots
— In this paper, we consider the problem of robot motion planning in order to satisfy formulas expressible in temporal logics. Temporal logics naturally express traditional robot...
Georgios E. Fainekos, Hadas Kress-Gazit, George J....
ICALP
2005
Springer
14 years 2 months ago
Randomized Fast Design of Short DNA Words
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
Ming-Yang Kao, Manan Sanghi, Robert T. Schweller
SPIRE
2005
Springer
14 years 2 months ago
Using the k-Nearest Neighbor Graph for Proximity Searching in Metric Spaces
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
Rodrigo Paredes, Edgar Chávez
CAV
2006
Springer
86views Hardware» more  CAV 2006»
14 years 24 days ago
The Power of Hybrid Acceleration
This paper addresses the problem of computing symbolically the set of reachable configurations of a linear hybrid automaton. A solution proposed in earlier work consists in explori...
Bernard Boigelot, Frédéric Herbretea...
EUROCRYPT
2008
Springer
13 years 10 months ago
Efficient Non-interactive Proof Systems for Bilinear Groups
Non-interactive zero-knowledge proofs and non-interactive witness-indistinguishable proofs have played a significant role in the theory of cryptography. However, lack of efficienc...
Jens Groth, Amit Sahai