نتایج جستجو برای: difference sequence space
تعداد نتایج: 1271782 فیلتر نتایج به سال:
Most modern compilers operate by applying a fixed sequence of code optimizations, called a compilation sequence, to all programs. Compiler writers determine a small set of good, general-purpose, compilation sequences by extensive hand-tuning over particular benchmarks. The compilation sequence makes a significant difference in the quality of the generated code; in particular, we know that a sin...
MOTIVATION Sequence alignment is the problem of finding the optimal character-by-character correspondence between two sequences. It can be readily solved in O(n2) time and O(n2) space on a serial machine, or in O(n) time with O(n) space per O(n) processing elements on a parallel machine. Hirschberg's divide-and-conquer approach for finding the single best path reduces space use by a factor of n...
In this study, we construct the difference sequence spaces lp (P?2q) = (lp)P?2q, 1 ? p ?, where P (?rs) is an infinite matrix of Padovan numbers %s defined by ?rs {?s/?r+5-2 0 s r, > r. and ?2q a q-difference operator second order. We obtain some inclusion relations, topological properties, Schauder basis ?-, ?- ?-duals newly space. characterize certain classes from space to any one l1, c0, ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید