Sciweavers

4377 search results - page 349 / 876
» Mass problems and randomness
Sort
View
GRID
2004
Springer
16 years 5 days ago
A Stochastic Control Model for Deployment of Dynamic Grid Services
We introduce a formal model for deployment and hosting of a dynamic grid service wherein the service provider must pay a resource provider for the use of computational resources. ...
Darin England, Jon B. Weissman
ICRA
2003
IEEE
139views Robotics» more  ICRA 2003»
16 years 2 days ago
Mobile robot localization with an incomplete map in non-stationary environments
— One of the fundamental problems of the mobile robots is self-localization, i.e. to estimate the self-position by comparing sensor data and a map. In non-stationary environments...
Kanji Tanaka, Tsutomu Hasegawa, Hongbin Zha, Eiji ...
PODC
2003
ACM
16 years 1 days ago
Routing networks for distributed hash tables
Routing topologies for distributed hashing in peer-to-peer networks are classified into two categories: deterministic and randomized. A general technique for constructing determi...
Gurmeet Singh Manku
ACNS
2010
Springer
159views Cryptology» more  ACNS 2010»
15 years 11 months ago
A Message Recognition Protocol Based on Standard Assumptions
We look at the problem of designing Message Recognition Protocols (MRP) and note that all proposals available in the literature have relied on security proofs which hold in the ran...
Atefeh Mashatan, Serge Vaudenay
202
Voted
ASIACRYPT
2001
Springer
15 years 11 months ago
How to Achieve a McEliece-Based Digital Signature Scheme
Abstract. McEliece is one of the oldest known public key cryptosystems. Though it was less widely studied than RSA, it is remarkable that all known attacks are still exponential. I...
Nicolas Courtois, Matthieu Finiasz, Nicolas Sendri...