Results 1 to 10 of about 4,649,254 (341)
Algebraic Distributed Space-Time Codes with Low ML Decoding Complexity [PDF]
, 2007 "Extended Clifford algebras" are introduced as a means to obtain low ML decoding complexity space-time block codes. Using left regular matrix representations of two specific classes of extended Clifford algebras, two systematic algebraic constructions of
G. Susinder Rajan, B. Sundar Rajan
openalex +3 more sources
Mathematics, 2023 The method of the optimal movement trajectory construction in the terrain patrolling tasks is proposed. The method is based on the search of the Hamiltonian circuit on the graph of the terrain map and allows automatic construction of the optimal closed ...
Boris V. Rumiantsev +2 more
doaj +1 more source
Performance Testing Technique for Applied Programs [PDF]
مجلة جامعة الانبار للعلوم الصرفة, 2012 In this paper, software was preparedto use for measuring the programs performance because of the importance of measuring the programs performance. The performance of any program basically depends on spent time and storing area needed to implement any ...
Falath M. Mohammad, Mortadha M. Hamad
doaj +1 more source
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
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
On the Time Dependence of Holographic Complexity [PDF]
, 2017 We evaluate the full time dependence of holographic complexity in various eternal black hole backgrounds using both the complexity=action (CA) and the complexity=volume (CV) conjectures.
Carmi, Dean +4 more
core +8 more sources
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
BMC Public Health, 2017 Background As service provision and patient behaviour varies by day, healthcare data used for public health surveillance can exhibit large day of the week effects. These regular effects are further complicated by the impact of public holidays.
Elizabeth Buckingham-Jeffery +5 more
doaj +1 more source
Real-time complexity constrained encoding [PDF]
, 2016 Complex software appliances can be deployed on hardware with limited available computational resources. This computational boundary puts an additional constraint on software applications.
Lambert, Peter +4 more
core +1 more source