Results 1 - 10 of 816

Cryptographic Limitations on Learning Boolean Formulae and Finite Automata

by Michael Kearns, Leslie Valiant - PROCEEDINGS OF THE TWENTY-FIRST ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING , 1989
"... In this paper we prove the intractability of learning several classes of Boolean functions in the distribution-free 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 well-known public-key cryptosystems to the learning problems. We prove that a polynomial-time learning algorithm for Boolean formulae, deterministic finite automata or constant

Lost in Self-stabilization. ∗

by Damien Regnault , 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,

Fault-Containing Self-Stabilizing Algorithms

by Sukumar Ghosh, Arobinda Gupta, Ted Herman, Sriram V. Pemmaraju - In PODC96 Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing , 1996
"... . Self-stabilization provides a non-masking approach to fault tolerance. Given this fact, one would hope that in a self-stabilizing system, the amount of disruption caused by a fault is proportional to the severity of the fault. However, this is not true for many self-stabilizing systems. Our paper ..."
Abstract - Cited by 78 (8 self) - Add to MetaCart
addresses this weakness of distributed self-stabilizing systems by introducing the notion of fault containment. Informally, a fault-containing self-stabilizing algorithm is one that contains the effects of limited transient faults while retaining the property of self-stabilization. The paper begins with a

Organizing a Global Coordinate System from Local Information on an Amorphous Computer

by Radhika Nagpal , 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

by Rajeev Alur , Thomas A. Henzinger , Pei-hsin Ho , 1996
"... We present a model-checking 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 real-valued 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, time-bounded, and duration requirements of digital controllers, schedulers, and distributed algorithms.

Probabilistic Self-Stabilization

by Ted Herman , 1990
"... A probabilistic self-stabilizing 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

Self-Stabilizing Universal Algorithms

by Paolo Boldi, Sebastiano Vigna - Self--Stabilizing Systems (Proc. of the 3rd Workshop on Self--Stabilizing Systems , 1997
"... . We prove the existence of a "universal" self-stabilizing 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" self-stabilizing 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 self-stabilizing leader election

by Shlomi Dolev, Amos Israeli, Shlomo Moran - IEEE Transactions on Parallel and Distributed Systems , 1997
"... Abstract—A distributed system is self-stabilizing 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 self-stabilization 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 leader-election algorithm. We conclude this work by presenting a simple, uniform, self-stabilizing ranking protocol. Index Terms—Self-stabilizing systems, leader election, distributed algorithms, randomized distributed algorithms, synchronization. 1

Time Optimal Self-Stabilizing Spanning Tree Algorithms

by Sudhanshu Aggarwal, Shay Kutten - In FSTTCS93 Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science, Springer-Verlag LNCS:761 , 1993
"... In this paper we present time-optimal self-stabilizing algorithms for asynchronous distributed spanning tree computation in networks. ..."
Abstract - Cited by 62 (9 self) - Add to MetaCart
In this paper we present time-optimal self-stabilizing algorithms for asynchronous distributed spanning tree computation in networks.

The Power of Amnesia: Learning Probabilistic Automata with Variable Memory Length

by Dana Ron, Yoram Singer, NAFTALI TISHBY - 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