Results 1  10
of
2,980,799
Distrib. Comput. (2001) 14: 127–146 The BG distributed simulation algorithm ⋆
, 2001
"... Summary. We present a shared memory algorithm that allows a set of f +1processes to waitfree “simulate ” a larger system of n processes,that may also exhibit up to f stopping failures. Applying this simulation algorithm to the ksetagreement problem enables conversion of an arbitrary kfaulttoler ..."
Abstract
 Add to MetaCart
Summary. We present a shared memory algorithm that allows a set of f +1processes to waitfree “simulate ” a larger system of n processes,that may also exhibit up to f stopping failures. Applying this simulation algorithm to the ksetagreement problem enables conversion of an arbitrary k
On the BorowskyGafni simulation algorithm, brief announcement
 Proceedings of the 15th ACM Symposium on Principles of Distributed Computing
, 1996
"... Consider a read/write asynchronous shared memory system. In [1], Borowsky and G&i describe an algorithm that allows a set of f + 1 processes, any ~ of which may exhibit stopping failures, to “simulate ” a larger number n of processes, also with at most ~ failures. This simulation algorithm is us ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
is used in [1] to convert an arbitrary kfaulttolerant nprocess solution for the ksetagreement problem into a waitfree k+ 1process solution for the same problem. Since the k+lprocess ksetagreement problem has been shown to have no waitfree solution (e.g. [1]), this transformation implies
Looking for the Weakest Failure Detector for kSet Agreement in Messagepassing Systems
 Is Πk the End of the Road?, INRIA, 2009, http://hal.inria.fr/inria00384993/en/, PI
, 1929
"... Abstract: In the kset agreement problem, each process (in a set of n processes) proposes a value and has to decide a proposed value in such a way that at most k different values are decided. While this problem can easily be solved in asynchronous systems prone to t process crashes when k> t, it ..."
Abstract

Cited by 13 (3 self)
 Add to MetaCart
Abstract: In the kset agreement problem, each process (in a set of n processes) proposes a value and has to decide a proposed value in such a way that at most k different values are decided. While this problem can easily be solved in asynchronous systems prone to t process crashes when k> t
ConditionBased Protocols for Set Agreement Problems
, 2002
"... In this paper, we present condition based solutions to kset agreement problems. A condition C is a set of input vectors to the problem. We identify a class of conditions that allow to solve kset agreement in spite of f crashes in an asynchronous system. Moreover, we design a protocol that is alway ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
In this paper, we present condition based solutions to kset agreement problems. A condition C is a set of input vectors to the problem. We identify a class of conditions that allow to solve kset agreement in spite of f crashes in an asynchronous system. Moreover, we design a protocol
A standardized set of 260 pictures: Norms for name agreement, image agreement, familiarity, and visual complexity
 JOURNAL OF EXPERIMENTAL PSYCHOLOGY: HUMAN LEARNING AND MEMORY
, 1980
"... In this article we present a standardized set of 260 pictures for use in experiments investigating differences and similarities in the processing of pictures and words. The pictures are blackandwhite line drawings executed according to a set of rules that provide consistency of pictorial represent ..."
Abstract

Cited by 615 (1 self)
 Add to MetaCart
In this article we present a standardized set of 260 pictures for use in experiments investigating differences and similarities in the processing of pictures and words. The pictures are blackandwhite line drawings executed according to a set of rules that provide consistency of pictorial
More Choices Allow More Faults: Set Consensus Problems In Totally Asynchronous Systems
 Information and Computation
, 1992
"... We define the kset consensus problem as an extension of the consensus problem, where each processor decides on a single value such that the set of decided values in any run is of size at most k. We require the agreement condition that all values decided upon are initial values of some processor. ..."
Abstract

Cited by 115 (4 self)
 Add to MetaCart
We define the kset consensus problem as an extension of the consensus problem, where each processor decides on a single value such that the set of decided values in any run is of size at most k. We require the agreement condition that all values decided upon are initial values of some processor
A Topological Treatment of EarlyDeciding SetAgreement
, 2008
"... The ksetagreement problem consists for a set of n processes to agree on less than k among n possibly different values, each initially known to only one process. The problem is at the heart of distributed computing and generalizes the celebrated consensus problem. This paper considers the ksetagr ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
The ksetagreement problem consists for a set of n processes to agree on less than k among n possibly different values, each initially known to only one process. The problem is at the heart of distributed computing and generalizes the celebrated consensus problem. This paper considers the ksetagreement
Global Optimization with Polynomials and the Problem of Moments
 SIAM Journal on Optimization
, 2001
"... We consider the problem of finding the unconstrained global minimum of a realvalued polynomial p(x) : R R, as well as the global minimum of p(x), in a compact set K defined by polynomial inequalities. It is shown that this problem reduces to solving an (often finite) sequence of convex linear mat ..."
Abstract

Cited by 569 (47 self)
 Add to MetaCart
We consider the problem of finding the unconstrained global minimum of a realvalued polynomial p(x) : R R, as well as the global minimum of p(x), in a compact set K defined by polynomial inequalities. It is shown that this problem reduces to solving an (often finite) sequence of convex linear
The Extended Linear Complementarity Problem
, 1993
"... We consider an extension of the horizontal linear complementarity problem, which we call the extended linear complementarity problem (XLCP). With the aid of a natural bilinear program, we establish various properties of this extended complementarity problem; these include the convexity of the biline ..."
Abstract

Cited by 776 (28 self)
 Add to MetaCart
We consider an extension of the horizontal linear complementarity problem, which we call the extended linear complementarity problem (XLCP). With the aid of a natural bilinear program, we establish various properties of this extended complementarity problem; these include the convexity
Where the REALLY Hard Problems Are
 IN J. MYLOPOULOS AND R. REITER (EDS.), PROCEEDINGS OF 12TH INTERNATIONAL JOINT CONFERENCE ON AI (IJCAI91),VOLUME 1
, 1991
"... It is well known that for many NPcomplete problems, such as KSat, etc., typical cases are easy to solve; so that computationally hard cases must be rare (assuming P != NP). This paper shows that NPcomplete problems can be summarized by at least one "order parameter", and that the hard p ..."
Abstract

Cited by 681 (1 self)
 Add to MetaCart
It is well known that for many NPcomplete problems, such as KSat, etc., typical cases are easy to solve; so that computationally hard cases must be rare (assuming P != NP). This paper shows that NPcomplete problems can be summarized by at least one "order parameter", and that the hard
Results 1  10
of
2,980,799