A self-stabilizing Pantoja-like indirect algorithm for optimal control
نویسندگان
چکیده
منابع مشابه
A distributed self-stabilizing algorithm for argumentation
We propose a distributed approach to argumentation in which arguments are constructed by asynchronous processes which compute their own defeat status on the basis of local information. We present a self-stabilizing algorithm for the computation of defeat status, along with a proof of its correctness. The proposed approach introduces a remarkable flexibility in the management of argumentation ac...
متن کاملA self-stabilizing enumeration algorithm
This paper describes a self-stabilizing version of an algorithm presented by A. Mazurkiewicz [Inform. Process. Lett. 61 (1997) 233–239] for enumerating nodes by local rules on an anonymous network. The result improves the reliability aspects of the original algorithm and underlines the importance of a non-ambiguous topology for a network. 2001 Elsevier Science B.V. All rights reserved.
متن کاملSelf-Stabilizing Scheduling Algorithm for Cooperating Robots
We address the problem of autonomous robots which alternate between execution of individual tasks and peer-to-peer communication. Each robot keeps in its permanent memory a set of locations where it can meet some of the other robots. The proposed self-stabilizing algorithm solves the management of visits to these locations ensuring that after the stabilizing phase, every visit to a location wil...
متن کاملA Space Optimal, Deterministic, Self-Stabilizing, Leader Election Algorithm for Unidirectional Rings
A new, self-stabilizing algorithm for electing a leader on a unidirectional ring of prime size is presented for the composite atomicity model with a centralized daemon. Its space complexity is optimal to within a small additive constant number of bits per processor, significantly improving previous self-stabilizing algorithms for this problem. In other models or when the ring size is composite,...
متن کاملA Space-Optimal Self-Stabilizing Algorithm for the Maximal Independent Set Problem
Self-stabilization is a theoretical framework of nonmasking fault-tolerant distributed algorithms. In this paper, we propose a self-stabilizing algorithm for the maximal independent set problem in distributed systems assuming the state reading model under the distributed scheduler. Space complexity of proposed algorithm is two-state, and upper bound of time complexity is (n+ 2)(n+ 1)/4 steps, w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization Methods and Software
سال: 2001
ISSN: 1055-6788,1029-4937
DOI: 10.1080/10556780108805833