Results 51 to 60 of about 22,397,908 (376)
Computations on Nondeterministic Cellular Automata [PDF]
, 1998 The work is concerned with the trade-offs between the dimension and the time and space complexity of computations on nondeterministic cellular automata. It is proved, that 1).
Ozhigov, Yuri
core +3 more sources
On Parameterized Exponential Time Complexity
Theoretical Computer Science, 2009 AbstractIn this paper we study the notion of parameterized exponential time complexity. We show that a parameterized problem can be solved in parameterized 2o(f(k))p(n) time if and only if it is solvable in time O(2δf(k)q(n)) for any constant δ>0, where p and q are polynomials.
Ge Xia, Iyad A. Kanj, Jianer Chen
openaire +2 more sources
A Pseudo Random Pursuit Strategy for Atomic Clocks
IEEE Access, 2023 The atomic clock prediction algorithm is a critical part of the atomic time scale system to ensure its stability and accuracy. Random pursuit strategy (RPS) has been verified on the prediction capability of hydrogen maser and cesium clock in our previous
Qian Xu +4 more
doaj +1 more source
Space-Time Complexity in Hamiltonian Dynamics
, 2003 New notions of the complexity function C(epsilon;t,s) and entropy function S(epsilon;t,s) are introduced to describe systems with nonzero or zero Lyapunov exponents or systems that exhibit strong intermittent behavior with ``flights'', trappings, weak ...
Brudno A. A. +7 more
core +1 more source
A reduced-complexity and asymptotically efficient time-delay estimator [PDF]
, 2000 This paper considers the problem of estimating the time delays of multiple replicas of a known signal received by an array of antennas. Under the assumptions that the noise and co-channel interference (CCI) are spatially colored Gaussian processes and ...
Astély, D +3 more
core +1 more source
Linear Time Complexity Time Series Clustering with Symbolic Pattern Forest
International Joint Conference on Artificial Intelligence, 2019 With increasing powering of data storage and advances in data generation and collection technologies, large volumes of time series data become available and the content is changing rapidly.
Xiaosheng Li, Jessica Lin, Liang Zhao
semanticscholar +1 more source
Time complexity of concurrent programs [PDF]
International Workshop on Formal Aspects of Component Software, 2015 We study the problem of automatically computing the time complexity of concurrent object-oriented programs. To determine this complexity we use intermediate abstract descriptions that record relevant information for the time analysis cost of statements ...
Elena Giachino +3 more
semanticscholar +1 more source
A Multi-Dimensional Matrix Product—A Natural Tool for Parameterized Graph Algorithms
Algorithms, 2022 We introduce the concept of a k-dimensional matrix product D of k matrices A1,…,Ak of sizes n1×n,…,nk×n, respectively, where D[i1,…,ik] is equal to ∑ℓ=1nA1[i1,ℓ]×…×Ak[ik,ℓ].
Mirosław Kowaluk, Andrzej Lingas
doaj +1 more source
Some variants of reverse selective center location problem on trees under the Chebyshev and Hamming norms [PDF]
Yugoslav Journal of Operations Research, 2017 This paper is concerned with two variants of the reverse selective center location problems on tree graphs under the Hamming and Chebyshev cost norms in which the customers are existing on a selective subset of the vertices of the underlying tree.
Etemad Roghayeh, Alizadeh Behrooz
doaj +1 more source
Computation, 2023 In max-plus algebra, some algorithms for determining the eigenvector of irreducible matrices are the power algorithm and the Kleene star algorithm. In this research, a modified Kleene star algorithm will be discussed to compensate for the disadvantages ...
Ema Carnia +4 more
doaj +1 more source