منابع مشابه
A Perturbation-Incremental Method for Delay Differential Equations
A perturbation-incremental (PI) method is presented for the computation, continuation and bifurcation analysis of periodic solutions of nonlinear systems of delay differential equations (DDEs). Periodic solutions can be calculated to any desired degree of accuracy and their stabilities are determined by the Floquet theory. Branch switching at a period-doubling bifurcation is made simple by the ...
متن کامل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...
متن کاملGenerating All Minimal Edge Dominating Sets with Incremental-Polynomial Delay
For an arbitrary undirected simple graph G with m edges, we give an algorithm with running time O(m|L|) to generate the set L of all minimal edge dominating sets of G. For bipartite graphs we obtain a better result; we show that their minimal edge dominating sets can be enumerated in time O(m|L|). In fact our results are stronger; both algorithms generate the next minimal edge dominating set wi...
متن کاملMSO satisfaction is FPT on
There is a computable function f such that the problem of deciding, given a word w and an MSO sentence φ whether, S w |= φ can be decided in time O(f (l)n) where l is the length of φ and n is the length of w.
متن کاملAn FPT Algorithm for Tree Deletion Set
We give a 5n time fixed-parameter algorithm for determining whether a given undirected graph on n vertices has a subset of at most k vertices whose deletion results in a tree. Such a subset is a restricted form of a feedback vertex set. While parameterized complexity of feedback vertex set problem and several of its variations have been well studied, to the best of our knowledge, this is the fi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms
سال: 2020
ISSN: 1999-4893
DOI: 10.3390/a13050122