نتایج جستجو برای: stabilization

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

2009
Xiaoxia Li Thomas A. Hamilton Justin Hartupee Caini Liu Michael Novotny Dongxu Sun

Journal: :SIAM J. Control and Optimization 2002
Alberto Bressan Giuseppe Maria Coclite

The paper is concerned with the boundary controllability of entropy weak solutions to hyperbolic systems of conservation laws. We prove a general result on the asymptotic stabilization of a system near a constant state. On the other hand, we give an example showing that exact controllability in finite time cannot be achieved, in general.

Journal: :CoRR 2015
Luca Becchetti Andrea E. F. Clementi Emanuele Natale Francesco Pasquale

By using concrete scenarios, we present and discuss a new concept of probabilistic Self-Stabilization in Distributed Systems.

2005
Felix C. Freiling Sukumar Ghosh

Dijkstra’s concept of self-stabilization assumes that faults can only affect the variables of a program. We study the notion of self-stabilization if faults can also affect (i.e., augment) the program code of a system. A code stabilizing system automatically recovers from (almost) arbitrary perturbations of its program code. We prove some lower bounds for code stabilizing systems and argue that...

Journal: :J. High Speed Networks 2005
Joffroy Beauquier Laurence Pilard Brigitte Rozoy

2012
Giorgio Donati Nicola Durante

Let G be the group of projectivities stabilizing a unital U in PG(2, q2). In this paper, we prove that U is a classical unital if and only if there are two points in U such that the stabilizer of these two points in G has order q2 − 1.

1998
T. Yanagida

We consider dilaton stabilization with R invariance, which insures a vanishing cosmological constant at the scale of stabilization. We construct a few models which accommodate weak gauge couplings with large or small gauge groups. Matter condensation plays a central role in the dilaton stabilization.

1997
Ted Herman

Kutten and Patt-Shamir have proposed a method for fast recovery of the output of a non-reactive, distributed protocol: if f < n=2 processors are corrupted from a legitimate global state, then the method recovers the output in O(f) time. The proposed method leaves open the case f n=2. This note presents a technique to handle also the case of f n=2, again recovering the output in O(f) time. The r...

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

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