Results 1  10
of
816
Cryptographic Limitations on Learning Boolean Formulae and Finite Automata
 PROCEEDINGS OF THE TWENTYFIRST ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING
, 1989
"... In this paper we prove the intractability of learning several classes of Boolean functions in the distributionfree model (also called the Probably Approximately Correct or PAC model) of learning from examples. These results are representation independent, in that they hold regardless of the syntact ..."
Abstract

Cited by 347 (14 self)
 Add to MetaCart
of the syntactic form in which the learner chooses to represent its hypotheses. Our methods reduce the problems of cracking a number of wellknown publickey cryptosystems to the learning problems. We prove that a polynomialtime learning algorithm for Boolean formulae, deterministic finite automata or constant
Lost in Selfstabilization. ∗
, 2014
"... One of the questions addressed here is ”How can a twisted thread correct itself?”. We consider a theoretical model where the studied mathematical object represents a 2D twisted discrete thread linking two points. This thread is made of a chain of agents which are “lost”, i.e. they have no knowledge ..."
Abstract
 Add to MetaCart
in crystallography [2, 3, 8], stochastic cellular automata [6, 7], organizing a line of robots in distributed algorithms (the robot chain problem [5, 11]), and Christoffel words in language theory [1]. ∗This work is partially supported by Programs ANR Dynamite, Quasicool and IXXI (Complex System Institute,
FaultContaining SelfStabilizing Algorithms
 In PODC96 Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing
, 1996
"... . Selfstabilization provides a nonmasking approach to fault tolerance. Given this fact, one would hope that in a selfstabilizing system, the amount of disruption caused by a fault is proportional to the severity of the fault. However, this is not true for many selfstabilizing systems. Our paper ..."
Abstract

Cited by 78 (8 self)
 Add to MetaCart
addresses this weakness of distributed selfstabilizing systems by introducing the notion of fault containment. Informally, a faultcontaining selfstabilizing algorithm is one that contains the effects of limited transient faults while retaining the property of selfstabilization. The paper begins with a
Organizing a Global Coordinate System from Local Information on an Amorphous Computer
, 1999
"... This paper demonstrates that it is possible to generate a reasonably accurate coordinate system on randomly distributed processors, using only local information and local communication. By coordinate system we imply that each element assigns itself a logical coordinate that maps to its global phy ..."
Abstract

Cited by 339 (7 self)
 Add to MetaCart
critical minimum average neighborhood size of 15 for good accuracy and there is a fundamental limit on the resolution of any coordinate system determined strictly from local communication. We also demonstrate that using this algorithm, random distributions of processors produce significantly better
Automatic Symbolic Verification of Embedded Systems
, 1996
"... We present a modelchecking procedure and its implementation for the automatic verification of embedded systems. The system components are described as Hybrid Automata  communicating machines with finite control and realvalued variables that represent continuous environment parameters such as tim ..."
Abstract

Cited by 330 (24 self)
 Add to MetaCart
is governed by linear constraints on the variables and their derivatives. We illustrate the method and the tool by checking safety, liveness, timebounded, and duration requirements of digital controllers, schedulers, and distributed algorithms.
Probabilistic SelfStabilization
, 1990
"... A probabilistic selfstabilizing algorithm for a ring of identical processes is presented; the number of processes in the ring is odd, the processes operate synchronously, and communication is unidirectional in the ring. The normal function of the algorithm is to circulate a single token in the ring ..."
Abstract

Cited by 59 (0 self)
 Add to MetaCart
in the ring. If the initial state of the ring is abnormal, i.e. the number of tokens differs from one, then execution of the algorithm results probabilistically in convergence to a normal state with one token. Keywords: Distributed Computing, Probabilistic Algorithms, SelfStabilization, Uniform Rings 0
SelfStabilizing Universal Algorithms
 SelfStabilizing Systems (Proc. of the 3rd Workshop on SelfStabilizing Systems
, 1997
"... . We prove the existence of a "universal" selfstabilizing algorithm, i.e., an algorithm which allows to stabilize a distributed system to a desired behaviour (as long as an algorithm stabilizing to that behaviour exists). Previous proposals required drastic increases in asymmetry and know ..."
Abstract

Cited by 8 (6 self)
 Add to MetaCart
. We prove the existence of a "universal" selfstabilizing algorithm, i.e., an algorithm which allows to stabilize a distributed system to a desired behaviour (as long as an algorithm stabilizing to that behaviour exists). Previous proposals required drastic increases in asymmetry
Uniform dynamic selfstabilizing leader election
 IEEE Transactions on Parallel and Distributed Systems
, 1997
"... Abstract—A distributed system is selfstabilizing if it can be started in any possible global state. Once started the system regains its consistency by itself, without any kind of outside intervention. The selfstabilization property makes the system tolerant to faults in which processors exhibit a ..."
Abstract

Cited by 109 (10 self)
 Add to MetaCart
for synchronization that are used as building blocks by the leaderelection algorithm. We conclude this work by presenting a simple, uniform, selfstabilizing ranking protocol. Index Terms—Selfstabilizing systems, leader election, distributed algorithms, randomized distributed algorithms, synchronization. 1
Time Optimal SelfStabilizing Spanning Tree Algorithms
 In FSTTCS93 Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science, SpringerVerlag LNCS:761
, 1993
"... In this paper we present timeoptimal selfstabilizing algorithms for asynchronous distributed spanning tree computation in networks. ..."
Abstract

Cited by 62 (9 self)
 Add to MetaCart
In this paper we present timeoptimal selfstabilizing algorithms for asynchronous distributed spanning tree computation in networks.
The Power of Amnesia: Learning Probabilistic Automata with Variable Memory Length
 Machine Learning
, 1996
"... . We propose and analyze a distribution learning algorithm for variable memory length Markov processes. These processes can be described by a subclass of probabilistic finite automata which we name Probabilistic Suffix Automata (PSA). Though hardness results are known for learning distributions gene ..."
Abstract

Cited by 226 (17 self)
 Add to MetaCart
. We propose and analyze a distribution learning algorithm for variable memory length Markov processes. These processes can be described by a subclass of probabilistic finite automata which we name Probabilistic Suffix Automata (PSA). Though hardness results are known for learning distributions
Results 1  10
of
816