Results 1  10
of
145,664
Membership Algorithms for Multicast Communication Groups
 In 6th Intl. Workshop on Distributed Algorithms proceedings (WDAG6), (LCNS
, 1992
"... We introduce a membership protocol that maintains the set of currently connected machines in an asynchronous and dynamic environment. The protocol handles both failures and joining of machines. It operates within a multicast communication subsystem. It is well known that solving the membership prob ..."
Abstract

Cited by 80 (16 self)
 Add to MetaCart
We introduce a membership protocol that maintains the set of currently connected machines in an asynchronous and dynamic environment. The protocol handles both failures and joining of machines. It operates within a multicast communication subsystem. It is well known that solving the membership
Formal Verification Of The TTP Group Membership Algorithm
 IN IFIP TC6/WG6.1 INTERNATIONAL CONFERENCE ON FORMAL DESCRIPTION TECHNIQUES FOR DISTRIBUTED SYSTEMS AND COMMUNICATION PROTOCOLS AND PROTOCOL SPECIFICATION, TESTING AND VERIFICATION, FORTE/PSTV 2000
, 2000
"... This paper describes the formal verification of a faulttolerant group membership algorithm that constitutes one of the central services of the TimeTriggered Protocol (TTP). The group membership algorithm is formally specified and verified using a diagrammatic representation of the algorithm. We de ..."
Abstract

Cited by 31 (3 self)
 Add to MetaCart
This paper describes the formal verification of a faulttolerant group membership algorithm that constitutes one of the central services of the TimeTriggered Protocol (TTP). The group membership algorithm is formally specified and verified using a diagrammatic representation of the algorithm. We
SemiMembership Algorithms: Some Recent Advances
 SIGACT News
, 1994
"... A semimembership algorithm for a set A is, informally, a program that when given any two strings determines which is logically more likely to be in A. A flurry of interest in this topic in the late seventies and early eighties was followed by a relatively quiescent halfdecade. However, in the 1990 ..."
Abstract

Cited by 13 (9 self)
 Add to MetaCart
A semimembership algorithm for a set A is, informally, a program that when given any two strings determines which is logically more likely to be in A. A flurry of interest in this topic in the late seventies and early eighties was followed by a relatively quiescent halfdecade. However
Exploiting Sequent Structure in Membership Algorithms for the Lambek Calculus
"... Abstract. This paper will examine the open problem of whether or not a sequent is derivable in the Lambek Calculus (L) in polynomialtime. This will be done through an investigation of Lambek Calculus Graphs (LCGraphs), which were introduced by Penn[7] to represent the wellformedness constraints o ..."
Abstract
 Add to MetaCart
, a polynomialtime membership algorithm is presented that recognizes all derivable sequents and falsely recognizes an identifiable class of underivable sequents. 1
Randomized Algorithms
, 1995
"... Randomized algorithms, once viewed as a tool in computational number theory, have by now found widespread application. Growth has been fueled by the two major benefits of randomization: simplicity and speed. For many applications a randomized algorithm is the fastest algorithm available, or the simp ..."
Abstract

Cited by 2210 (37 self)
 Add to MetaCart
Randomized algorithms, once viewed as a tool in computational number theory, have by now found widespread application. Growth has been fueled by the two major benefits of randomization: simplicity and speed. For many applications a randomized algorithm is the fastest algorithm available
Parametric Verification of a Group Membership Algorithm
 Proceedings of the 7th International Symposium on Formal Techniques in RealTime and Fault Tolerant Systems
, 2002
"... We address the problem of verifying clique avoidance in the TTP protocol. TTP allows several stations embedded in a car to communicate. ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
We address the problem of verifying clique avoidance in the TTP protocol. TTP allows several stations embedded in a car to communicate.
Instancebased learning algorithms
 Machine Learning
, 1991
"... Abstract. Storing and using specific instances improves the performance of several supervised learning algorithms. These include algorithms that learn decision trees, classification rules, and distributed networks. However, no investigation has analyzed algorithms that use only specific instances to ..."
Abstract

Cited by 1359 (18 self)
 Add to MetaCart
Abstract. Storing and using specific instances improves the performance of several supervised learning algorithms. These include algorithms that learn decision trees, classification rules, and distributed networks. However, no investigation has analyzed algorithms that use only specific instances
Factor Graphs and the SumProduct Algorithm
 IEEE TRANSACTIONS ON INFORMATION THEORY
, 1998
"... A factor graph is a bipartite graph that expresses how a "global" function of many variables factors into a product of "local" functions. Factor graphs subsume many other graphical models including Bayesian networks, Markov random fields, and Tanner graphs. Following one simple c ..."
Abstract

Cited by 1787 (72 self)
 Add to MetaCart
computational rule, the sumproduct algorithm operates in factor graphs to computeeither exactly or approximatelyvarious marginal functions by distributed messagepassing in the graph. A wide variety of algorithms developed in artificial intelligence, signal processing, and digital communications can
An Adaptive Membership Algorithm for Application Layer Multicast
"... Due to deployment difficulty of network layer multicast, application layer multicast is considered to be a good substitute for massive P2P video/audio streaming in large networks. However, in application layer multicast, the participating users join and leave the ongoing session at will. Therefo ..."
Abstract
 Add to MetaCart
. Therefore, a scalable and reliable group membership management algorithm is necessary due to the highly dynamic nature of the overlay network, built on top of the Internet. Gossipbased algorithms seem to be a solution. However, most gossipbased membership management algorithms lack flexibility
Results 1  10
of
145,664