Sciweavers

2924 search results - page 123 / 585
» Lower Bounds in Distributed Computing
Sort
View
ASIACRYPT
2009
Springer
15 years 7 months ago
Security Bounds for the Design of Code-Based Cryptosystems
Code-based cryptography is often viewed as an interesting “Post-Quantum” alternative to the classical number theory cryptography. Unlike many other such alternatives, it has th...
Matthieu Finiasz, Nicolas Sendrier
IPPS
2007
IEEE
15 years 7 months ago
Prediction Services for Distributed Computing
Users of distributed systems such as the TeraGrid and Open Science Grid can execute their applications on many different systems. We wish to help such users, or the grid scheduler...
Warren Smith
FOCS
2006
IEEE
15 years 6 months ago
On the Quantum Query Complexity of Local Search in Two and Three Dimensions
The quantum query complexity of searching for local optima has been a subject of much interest in the recent literature. For the d-dimensional grid graphs, the complexity has been...
Xiaoming Sun, Andrew Chi-Chih Yao
108
Voted
IPPS
2008
IEEE
15 years 7 months ago
Resource allocation in a client/server hybrid network for virtual world environments
The creation of a virtual world environment (VWE) has significant costs, such as maintenance of server rooms, server administration, and customer service. The initial development...
Luis Diego Briceno, Howard Jay Siegel, Anthony A. ...
80
Voted
AAAI
2007
15 years 3 months ago
On the Value of Good Advice: The Complexity of A* Search with Accurate Heuristics
We study the behavior of the classical A∗ search algorithm when coupled with a heuristic that provides estimates, accurate to within a small multiplicative factor, of the distan...
Hang T. Dinh, Alexander Russell, Yuan Su