Sciweavers

5153 search results - page 660 / 1031
» Introduction to Randomized Algorithms
Sort
View
WDAG
2010
Springer
184views Algorithms» more  WDAG 2010»
15 years 3 months ago
Fast Asynchronous Consensus with Optimal Resilience
Abstract. We give randomized agreement algorithms with constant expected running time in asynchronous systems subject to process failures, where up to a minority of processes may f...
Ittai Abraham, Marcos Kawazoe Aguilera, Dahlia Mal...
CISC
2009
Springer
148views Cryptology» more  CISC 2009»
15 years 2 months ago
A DAA Scheme Requiring Less TPM Resources
Abstract. Direct anonymous attestation (DAA) is a special digital signature primitive, which provides a balance between signer authentication and privacy. One of the most interesti...
Liqun Chen
EUROPAR
2009
Springer
15 years 2 months ago
A Least-Resistance Path in Reasoning about Unstructured Overlay Networks
Unstructured overlay networks for peer-to-peer applications combined with stochastic algorithms for clustering and resource location are attractive due to low-maintenance costs and...
Giorgos Georgiadis, Marina Papatriantafilou
173
Voted
IJRR
2011
174views more  IJRR 2011»
14 years 11 months ago
Bounding on rough terrain with the LittleDog robot
— In this paper we develop an RRT-based motion planner that achieved bounding in simulation with the LittleDog robot over extremely rough terrain. LittleDog is a quadruped robot ...
Alexander C. Shkolnik, Michael Levashov, Ian R. Ma...
TEC
2011
134views more  TEC 2011»
14 years 11 months ago
Differential Evolution: A Survey of the State-of-the-Art
—Differential evolution (DE) is arguably one of the most powerful stochastic real-parameter optimization algorithms in current use. DE operates through similar computational step...
Swagatam Das, Ponnuthurai Nagaratnam Suganthan