54 search results - page 10 / 11 » Proving Copyless Message Passing |
CORR
2006
Springer
13 years 5 months ago
2006
Springer
Despite the apparent similarity between shared randomness and shared entanglement in the context of Communication Complexity, our understanding of the latter is not as good as of ...
SIAMIS
2010
13 years 16 days ago
2010
Simulated annealing (SA) and deterministic continuation are well-known generic approaches to global optimization. Deterministic continuation is computationally attractive but produ...
MOBIHOC
2009
ACM
14 years 6 months ago
2009
ACM
Distributed scheduling algorithms for wireless ad hoc networks have received substantial attention over the last decade. The complexity levels of these algorithms span a wide spec...
STOC
2001
ACM
14 years 6 months ago
2001
ACM
This article introduces and explores the condition-based approach to solve the consensus problem in asynchronous systems. The approach studies conditions that identify sets of inpu...
ICDCS
2009
IEEE
14 years 3 months ago
2009
IEEE
Providing distributed processes with concurrent objects is a fundamental service that has to be offered by any distributed system. The classical shared read/write register is one ...