Sciweavers

310 search results - page 56 / 62
» From Non-Negative to General Operator Cost Partitioning
Sort
View
PODC
2004
ACM
15 years 4 months ago
Byzantine disk paxos: optimal resilience with byzantine shared memory
We present Byzantine Disk Paxos, an asynchronous shared-memory consensus algorithm that uses a collection of n > 3t disks, t of which may fail by becoming non-responsive or arb...
Ittai Abraham, Gregory Chockler, Idit Keidar, Dahl...
MICRO
2009
IEEE
144views Hardware» more  MICRO 2009»
15 years 5 months ago
Characterizing flash memory: anomalies, observations, and applications
Despite flash memory’s promise, it suffers from many idiosyncrasies such as limited durability, data integrity problems, and asymmetry in operation granularity. As architects, ...
Laura M. Grupp, Adrian M. Caulfield, Joel Coburn, ...
AIPS
2008
15 years 1 months ago
A Compact and Efficient SAT Encoding for Planning
In the planning-as-SAT paradigm there have been numerous recent developments towards improving the speed and scalability of planning at the cost of finding a step-optimal parallel...
Nathan Robinson, Charles Gretton, Duc Nghia Pham, ...
CPHYSICS
2008
123views more  CPHYSICS 2008»
14 years 11 months ago
wannier90: A tool for obtaining maximally-localised Wannier functions
We present wannier90, a program for calculating maximally-localised Wannier functions (MLWF) from a set of Bloch energy bands that may or may not be attached to or mixed with othe...
Arash A. Mostofi, Jonathan R. Yates, Young-Su Lee,...
80
Voted
CCS
2009
ACM
15 years 5 months ago
Scalable onion routing with torsk
We introduce Torsk, a structured peer-to-peer low-latency anonymity protocol. Torsk is designed as an interoperable replacement for the relay selection and directory service of th...
Jon McLachlan, Andrew Tran, Nicholas Hopper, Yongd...