نتایج جستجو برای: consensus oriented

تعداد نتایج: 209088  

Journal: :journal of ai and data mining 2015
f. tatari m. b. naghibi-sistani

in this paper, the optimal adaptive leader-follower consensus of linear continuous time multi-agent systems is considered. the error dynamics of each player depends on its neighbors’ information. detailed analysis of online optimal leader-follower consensus under known and unknown dynamics is presented. the introduced reinforcement learning-based algorithms learn online the approximate solution...

Journal: :J. Parallel Distrib. Comput. 2007
Taisuke Izumi Akinori Saitoh Toshimitsu Masuzawa

The ∆-timed uniform consensus is a stronger variant of the traditional consensus and it satisfies the following additional property: Every correct process terminates its execution within a constant time ∆ (∆-timeliness), and no two processes decide differently (Uniformity). In this paper, we consider the ∆-timed uniform consensus problem in presence of fc crash processes and ft timing-faulty pr...

2011
Robert J Levine Myron Genel Leona Cuttler Dorothy J Becker Lynnette Nieman Robert L Rosenfield

BACKGROUND Many investigators are concerned that the modes of implementation and enforcement of the federal regulations designed to protect children are unduly impeding pediatric clinical research. OBJECTIVE To assess regulatory impediments to clinical research involving children and to develop recommendations to ameliorate them. PARTICIPANTS The Pediatric Endocrine Society and The Endocrin...

2007
Serge A. Plotkin

In this paper we consider implementation of atomic wait-free objects in the context of a shared-memory multiprocessor. We introduce a new primitive object, the \Sticky-Bit", and show its universality by proving that any safe implementation of a sequential object can be transformed into a wait-free atomic one using only Sticky Bits and safe registers. The Sticky Bit may be viewed as a memory-ori...

Journal: :Inf. Process. Lett. 2003
Idit Keidar Sergio Rajsbaum

We give a simple and intuitive proof of an f + 2 round lower bound for uniform consensus. That is, we show that for every uniform consensus algorithm tolerating t failures, and for every f t − 2, there is an execution with f failures that requires f + 2 rounds.  2002 Elsevier Science B.V. All rights reserved.

2013
Mirta Galesic Henrik Olsson Jörg Rieskamp

Research on human reasoning is dominated by demonstrations of the errors people make in various judgment and decision-making tasks. The area of social cognition is not an exception: the list of apparent errors is long and includes a number of contradictory phenomena. Here we explore a prominent example of the contradictory pairs of biases: false consensus and false uniqueness. We show in an emp...

2016
Rafael Pass

The distributed systems and cryptography literature traditionally has focused on protocols whose participants are known a priori. Bitcoin’s rapid rise to fame represents an exciting breakthrough: Bitcoin empirically demonstrated that by leveraging assumptions such as proofs-of-work, non-trivial secure applications can be built on top of a fully decentralized network where nodes join and leave f...

Journal: :طب و تزکیه 0

introduction: community-orientated medicine (come) is a topical area for debate in the current discussion about medical education, but it can be agued that medical education has always been in the community because medical practice is located therein. in this study the status of come in all universities were evaluated by educational development center (edc) of ministry of health and medical edu...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید