Searching for "The Choice Coordination Problem." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

14 documents found, showing 1 through 10. Next 10 →

1.1 The Choice Coordination Problem
by David S. Greenberg, Gadi Taubenfeld, Da-wei Wang
…. The Choice Coordination Problem with k alternatives (k- CCP) was introduced by Rabin in 1982 [Rab82…
Add To MetaCart

The Choice-Coordination Problem: Notes for a Correctness Proof
by Probabilistic Systems Group — 1996
…The choice-coordination problem: notes for a correctness proof Probabilistic Systems Group Draft…
Add To MetaCart

On the Exact Linearization of Structure From Motion
by Stefano Soatto, Pietro Perona — 1994
… "linearity" is a coordinate-dependent notion, is there a choice of coordinates such that the problem…
Cited by 3 (0 self) – Add To MetaCart

Efficient Program Transformations for Resilient Parallel Computation via Randomization
by Z. M. Kedem, K. V. Palem, M. O. Rabin, A. Raghunathan, Flp M. Fischer, N. Lynch, M. Paterson, Fw S. Fortune, J. Wyllie, Gi P. Gibbons, A More Practical Pram, He M. Herlihy, Heb M. Herlihy, Impossibility Results For — 1992
… Choice Coordination Problem," Acta Informatica, 17:121{134, 1982. [Ra83] M. Rabin, \Randomized Byzantine…
Cited by 44 (9 self) – Add To MetaCart

Distributing Identity
by Joshua R. Smith — 1999
…. In the computer science literature, this is referred to as the Choice Coordination problem. We can take…
Cited by 11 (0 self) – Add To MetaCart

Self Organizing Device Networks
by Joshua Smith
…. In the computer science literature, this is referred to as the Choice Coordination problem. We can take…
Cited by 1 (0 self) – Add To MetaCart

Distributed Protocols for ID Assignment
by Joshua Smith Jrs, Joshua R. Smith — 1998 — the IEEE Robotics and Automation Magazine
… for the Choice Coordination Problem, in which n processors must agree on a common choice of one out of k outcomes…
Cited by 1 (0 self) – Add To MetaCart

A Hundred Impossibility Proofs for Distributed Computing
by Nancy Lynch, Nancy A. Lynch — 1989
…-set shared variables in any asynchronous sharedmemory algorithm that solves the choice coordination problem…
Cited by 21 (1 self) – Add To MetaCart

Reasoning About Efficiency Within a Probabilistic µ-Calculus
by Annabelle McIver — 1998 — University of Birmingham, School of Computer Science
… abstracted from Rabin's randomised solution to the choice-coordination problem [19]. 2 Expectation…
Cited by 9 (2 self) – Add To MetaCart

Naming Symmetric Processes Using Shared Variables
by Omer Egecioglu, Ambuj K. Singh — 1994 — Distributed Computing
… in this area is the Choice Coordination Problem [28]. This problem consists of a set of processes and a set…
Cited by 10 (0 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB