Sciweavers

335 search results - page 8 / 67
» Solving the Hamiltonian path problem with a light-based comp...
Sort
View
CDC
2009
IEEE
172views Control Systems» more  CDC 2009»
14 years 3 days ago
A dynamic boundary guarding problem with translating targets
Abstract— We introduce a problem in which a service vehicle seeks to defend a deadline (boundary) from dynamically arriving mobile targets. The environment is a rectangle and the...
Stephen L. Smith, Shaunak Dattaprasad Bopardikar, ...
STOC
2003
ACM
174views Algorithms» more  STOC 2003»
14 years 7 months ago
Adiabatic quantum state generation and statistical zero knowledge
The design of new quantum algorithms has proven to be an extremely difficult task. This paper considers a different approach to the problem, by studying the problem of 'quant...
Dorit Aharonov, Amnon Ta-Shma

Publication
2630views
15 years 6 months ago
DIJKSTRA’S and Fast Marching Method for Optimal Path Planning
This technical report illustrates the differences in solving the optimal path problem (shortest path) using different methods, where the underlying PDE can be described by the eik...
RYO TAKEI
CRYPTO
2007
Springer
132views Cryptology» more  CRYPTO 2007»
14 years 1 months ago
How Should We Solve Search Problems Privately?
Abstract. Secure multiparty computation allows a group of distrusting parties to jointly compute a (possibly randomized) function of their inputs. However, it is often the case tha...
Amos Beimel, Tal Malkin, Kobbi Nissim, Enav Weinre...
HAIS
2009
Springer
13 years 12 months ago
A Vehicle Routing Problem Solved by Agents
The main purpose of this study is to find out a good solution to the vehicle routing problem considering heterogeneous vehicles. This problem tries to solve the generation of paths...
Maria Belén Vaquerizo García