10718 search results - page 1858 / 2144 » On the Circuit Implementation Problem |
137
click to vote
ICFP
2006
ACM
16 years 6 months ago
2006
ACM
We present language mechanisms for polymorphic, extensible records and their exact dual, polymorphic sums with extensible first-class cases. These features make it possible to eas...
166
click to vote
MOBIHOC
2006
ACM
16 years 5 months ago
2006
ACM
This paper presents a distributed implementation of RAND, a randomized time slot scheduling algorithm, called DRAND. DRAND runs in O() time and message complexity where is the max...
170
click to vote
SPAA
2009
ACM
16 years 3 months ago
2009
ACM
Abstract. At-most-once semantics is one of the standard models for object access in decentralized systems. Accessing an object, such as altering the state of the object by means of...
156
click to vote
EUROSYS
2007
ACM
16 years 3 months ago
2007
ACM
Most implementations of critical Internet protocols are written in type-unsafe languages such as C or C++ and are regularly vulnerable to serious security and reliability problems...
170
click to vote
SAC
2010
ACM
16 years 1 months ago
2010
ACM
Byzantine consensus in asynchronous message-passing systems has been shown to require at least 3f + 1 processes to be solvable in several system models (e.g., with failure detecto...