Incremental delay enumeration: Space and time
نویسندگان
چکیده
منابع مشابه
A Polynomial-Time-Delay and Polynomial-Space Algorithm for Enumeration Problems in Multi-criteria Optimization
We propose a polynomial-time-delay polynomial-space algorithm to enumerate all efficient extreme solutions of a multi-criteria minimum-cost spanning tree problem, while only the bicriteria case was studied in the literature. The algorithm is based on the reverse search framework due to Avis & Fukuda. We also show that the same technique can be applied to the multi-criteria version of the minimu...
متن کاملFinite time stabilization of time-delay nonlinear systems with uncertainty and time-varying delay
In this paper, the problem of finite-time stability and finite-time stabilization for a specific class of dynamical systems with nonlinear functions in the presence time-varying delay and norm-bounded uncertainty terms is investigated. Nonlinear functions are considered to satisfy the Lipchitz conditions. At first, sufficient conditions to guarantee the finite-time stability for time-delay nonl...
متن کاملIncremental learning using the time delay neural network
The Time Delay Neural Network (TDNN) is one of the neural network architectures that give excellent performance in tasks involving classification of temporal signals, such as phoneme classification, on-line gesture and handwriting recognition, and many others. One particular problem that occurs in on-line recognition tasks is how to deal with input patterns that are incorrectly recognized becau...
متن کاملA Polynomial Space and Polynomial Delay Algorithm for Enumeration of Maximal Motifs in a Sequence
In this paper, we consider the problem of enumerating all maximal motifs in an input string for the class of repeated motifs with wild cards. A maximal motif is such a representative motif that is not properly contained in any larger motifs with the same location lists. Although the enumeration problem for maximal motifs with wild cards has been studied in (Parida et al., CPM’01), (Pisanti et a...
متن کاملAn efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence
In this paper, we consider the problem of enumerating all maximal motifs in an input string for the class of repeated motifs with wild cards. A maximal motif is such a representative motif that is not properly contained in any larger motifs with the same location lists. Although the enumeration problem for maximal motifs with wild cards has been studied in (Parida et al., CPM’01), (Pisanti et a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2019
ISSN: 0166-218X
DOI: 10.1016/j.dam.2018.06.038