Sciweavers

356 search results - page 4 / 72
» Revisiting the Paxos Algorithm
Sort
View
173
Voted
CIDR
2011
342views Algorithms» more  CIDR 2011»
14 years 1 months ago
Megastore: Providing Scalable, Highly Available Storage for Interactive Services
Megastore is a storage system developed to meet the requirements of today’s interactive online services. Megastore blends the scalability of a NoSQL datastore with the convenien...
Jason Baker, Chris Bond, James Corbett, J. J. Furm...
TEC
2010
184views more  TEC 2010»
14 years 4 months ago
Automatic Reproduction of a Genius Algorithm: Strassen's Algorithm Revisited by Genetic Search
Abstract--In 1968, Volker Strassen, a young German mathematician, announced a clever algorithm to reduce the asymptotic complexity of n
Seunghyun Oh, Byung-Ro Moon
COREGRID
2007
Springer
15 years 3 months ago
Atomic Commitment in Transactional DHTs
We investigate the problem of atomic commit in transactional database systems built on top of Distributed Hash Tables. Therefore we present a framework for DHTs to provide strong d...
Monika Moser, Seif Haridi
60
Voted
EVOW
2010
Springer
15 years 4 months ago
Enhancing Genetic Algorithms by a Trie-Based Complete Solution Archive
Genetic algorithms (GAs) share a common weakness with most other metaheuristics: Candidate solutions are in general revisited multiple times, lowering diversity and wasting preciou...
Günther R. Raidl, Bin Hu
64
Voted
WDAG
2007
Springer
103views Algorithms» more  WDAG 2007»
15 years 3 months ago
Probabilistic Opaque Quorum Systems
Byzantine-fault-tolerant service protocols like Q/U and FaB Paxos that optimistically order requests can provide increased efficiency and fault scalability. However, these protocol...
Michael G. Merideth, Michael K. Reiter