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

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

2001
Carl E. Walsh

Inßation targeting regimes deÞne a performance measure for the central bank. A regime that places a large (small) weight on achieivng the target is analogous to a high (low) power incentive scheme. High powered incentive structures promote accountability but may distort stabilization policy. The optimal power under inßation targeting is derived under perfect and imperfect information. The funda...

2009
Oleg Lebedev Chloé Papineau

We study the effect of inflation on gaugino condensation in supergravity. Unless the Hubble scale H is significantly below the gaugino condensation scale, the gaugino condensate is a dynamical variable which cannot be integrated out. For a sufficiently high H, the gaugino condensate evolves to zero which in turn leads to dilaton/moduli destabilization. In practice, this often occurs at the Hubb...

2012
Jorge Bruno Silva Cristina P. Santos João Sequeira

An autonomous mobile robot should find feasible trajectories in order to avoid collisions with obstacles in its environment. This ability to plan collision-free trajectories requires two major aspects: modulation and generation of trajectories. This is especially important if temporal stabilization of the generated trajectories is considered. Temporal stabilization means to conform to the plann...

2017
Matthew Tyrrell Burrus Jourdan M. Cancienne Gregory M. Kurkis Evan J. Conte Justin W. Griffin Brian C. Werner David R. Diduch

This open‐access article is published and distributed under the Creative Commons Attribution ‐ NonCommercial ‐ No Derivatives License (http://creativecommons.org/licenses/by‐nc‐nd/3.0/), which permits the noncommercial use, distribution, and reproduction of the article in any medium, provided the original author and source are credited. You may not alter, transform, or build upon this article w...

2015
Jason J. Shin Randhir Mascarenhas Adam Blair Yanke Gregory P. Nicholson Brian J. Cole Anthony A. Romeo Nikhil N. Verma

This open-access article is published and distributed under the Creative Commons Attribution NonCommercial No Derivatives License (http://creativecommons.org/licenses/by-nc-nd/3.0/), which permits the noncommercial use, distribution, and reproduction of the article in any medium, provided the original author and source are credited. You may not alter, transform, or build upon this article witho...

2005
Jens Oehlerking Abhishek Dhama Oliver E. Theel

The verification of the self-stabilization property of a distributed algorithm is a complicated task. By exploiting certain analogies between self-stabilizing distributed algorithms and globally asymptotically stable feedback systems, techniques originally developed for the verification of feedback system stability can be adopted for the verification of selfstabilization of distributed algorith...

2011
Julien Jorda Todd O. Yeates

Disulfide bonds are generally not used to stabilize proteins in the cytosolic compartments of bacteria or eukaryotic cells, owing to the chemically reducing nature of those environments. In contrast, certain thermophilic archaea use disulfide bonding as a major mechanism for protein stabilization. Here, we provide a current survey of completely sequenced genomes, applying computational methods ...

Journal: :Theor. Comput. Sci. 2009
Jean R. S. Blair Fredrik Manne

We present a self-stabilizing algorithm for the distance-2 coloring problem that uses a constant number of variables on each node and that stabilizes in O(Δm) moves using at most Δ + 1 colors, where Δ is the maximum degree in the graph and m is the number of edges in the graph. The analysis holds true both for the sequential and the distributed adversarial daemon model. This should be compared ...

2014
Lélia Blin Pierre Fraigniaud Boaz Patt-Shamir

It follows from the definition of silent self-stabilization, and from the definition of proof-labeling scheme, that if there exists a silent self-stabilizing algorithm using `-bit registers for solving a task T , then there exists a proof-labeling scheme for T using registers of at most ` bits. The first result in this paper is the converse to this statement. We show that if there exists a proo...

2002
Jean R. S. Blair Fredrik Manne

Many proposed self-stabilizing algorithms require an exponential number of moves before stabilizing on a global solution, including some rooting algorithms for tree networks [1, 2, 3]. These results are vastly improved upon in [5] with tree rooting algorithms that require only O(n3 + n2 · ch) moves, where n is the number of nodes in the network and ch is the highest initial value of a variable....

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

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