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

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

2008
Friedrich Otto

Some lower bound results are presented that separate the language classes accepted by certain types of nonforgetting restarting automata or CD-systems of restarting automata from each other.

2007
Gundula Niemann

Jan car et al (1995) developed the restarting automaton as a formal model of certain syn-tactical aspects of natural languages. Here we mainly concentrate on the deterministic version of the restarting automaton and its variants, establishing some inclusion results for the class of Church-Rosser languages. In addition, it is shown that there is a close correspondence between various classes of ...

2011
Natalie Schluter

We present a study on lookahead hierarchies for restarting automata with auxiliary symbols and small lookahead. In particular, we show that there are just two different classes of languages recognised by RRWW automata, through the restriction of lookahead size. We also show that the respective (left-) monotone restarting automaton models characterise the context-free languages and that the resp...

1999
Andreas Stathopoulos David M. Young David R. Kincaid

Eigenvalue iterative methods, such as Arnoldi and Jacobi-Davidson, are typically used with restarting. This has signiicant performance shortcomings, since important components of the invariant subspace may be discarded. One way of saving more information at restart is the idea of \thick" restarting which keeps more Ritz vectors than needed. Our previously proposed dynamic thick restarting choos...

Journal: :SIAM J. Scientific Computing 1998
Andreas Stathopoulos Yousef Saad Kesheng Wu

The Davidson method is a popular preconditioned variant of the Arnoldi method for solving large eigenvalue problems. For theoretical, as well as practical reasons the two methods are often used with restarting. Frequently, information is saved through approximated eigen-vectors to compensate for the convergence impairment caused by restarting. We call this scheme of retaining more eigenvectors ...

Journal: :SIAM J. Scientific Computing 2011
Ronald B. Morgan Dywayne A. Nicely

A restarted nonsymmetric Lanczos algorithm is given for computing eigenvalues and both right and left eigenvectors. The restarting limits the storage so that finding eigenvectors is practical. Restarting also makes it possible to deal with roundoff error in new ways. We give a scheme for avoiding near-breakdown and discuss maintaining biorthogonality. A system of linear equations can be solved ...

2008
L. Ginsberg

This document describes a mechanism for a restarting router to signal to its neighbors that it is restarting, allowing them to reestablish their adjacencies without cycling through the down state, while still correctly initiating database synchronization. This document additionally describes a mechanism for a restarting router to determine when it has achieved Link State Protocol Data Unit (LSP...

Journal: :RAIRO - Theoretical Informatics and Applications 2007

Journal: :RFC 2004
Mike Shand Les Ginsberg

This document describes a mechanism for a restarting router to signal to its neighbors that it is restarting, allowing them to reestablish their adjacencies without cycling through the down state, while still correctly initiating database synchronization. This document additionally describes a mechanism for a restarting router to determine when it has achieved LSP database synchronization with ...

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

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