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

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

Journal: :Annals of emerging technologies in computing. 2021

Support vector regression (SVR) is well known as a or prediction tool under the Machine Learning (ML) which preserves all key features through training data. Different from general prediction, here, we proposed SVR to predict new approximate solutions after generated some iterates using an iterative method called Lanczos algorithm, one class of Krylov solvers. As know that solvers, including me...

2007
George Katsirelos

Nogood recording is a known technique for pruning the search tree in backtracking search. Unfortunately, unrestricted nogood recording carries an overhead which has lead to the development of restricted forms of it. In this paper, we show how recent developments in the SAT literature can be applied in CSPs to facilitate unrestricted nogood recording. This in turn allows us to effectively use re...

Journal: :Haematologica 2005
Serena Merante Ester Orlandi Paolo Bernasconi Silvia Calatroni Marina Boni Mario Lazzarino

Imatinib mesylate (IM) therapy is effective in patients with chronic myeloid leukemia (CML). However, whether it should be discontinued in patients who achieve sustained molecular response is debated. We describe 4 patients with undetectable levels of BCR-ABL transcripts in whom IM therapy was discontinued. Two patients relapsed after 7 and 10 months and promptly responded after restarting ther...

Journal: :SIAM J. Scientific Computing 2005
James Baglama Lothar Reichel

New restarted Lanczos bidiagonalization methods for the computation of a few of the largest or smallest singular values of a large matrix are presented. Restarting is carried out by augmentation of Krylov subspaces that arise naturally in the standard Lanczos bidiagonalization method. The augmenting vectors are associated with certain Ritz or harmonic Ritz vectors. Computed examples show the ne...

2014
Martin Plátek Dana Pardubská Markéta Lopatková

The paper provides linguistic observations as a motivation for a formal study of an analysis by reduction. It concentrates on a study of the whole mechanism through a class of restarting automata with meta-instructions using pebbles, with delete and shift operations (DSautomata). Four types of (in)finite sets defined by these automata are considered as linguistically relevant: basic languages o...

2007
R. Rahman

The extensions defined in this document build on the RSVP Hello extensions defined in RFC 3209, and extensions for state recovery on nodal faults defined in RFC 3473. Using these extensions, the restarting node can recover all previously transmitted Path state, including the Explicit Route Object and the downstream (outgoing) interface identifiers. The extensions can also be used to recover sig...

Journal: :RFC 2007
Arun Satyanarayana Reshad Rahman

The extensions defined in this document build on the RSVP Hello extensions defined in RFC 3209, and extensions for state recovery on nodal faults defined in RFC 3473. Using these extensions, the restarting node can recover all previously transmitted Path state, including the Explicit Route Object and the downstream (outgoing) interface identifiers. The extensions can also be used to recover sig...

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

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