Results 1 to 10 of about 1,215,744 (146)
The time complexity of self-assembly. [PDF]
Proc Natl Acad Sci U S A, 2022 ABSTRACTTime efficiency of self-assembly is crucial for many biological processes. Moreover, with the advances of nanotechnology, time efficiency in artificial self-assembly becomes ever more important. While structural determinants and the final assembly yield are increasingly well understood, kinetic aspects concerning the time efficiency, however ...
Gartner FM, Graf IR, Frey E.
europepmc +5 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
Complex-barrier tunnelling times [PDF]
Journal de Physique I, 1994 In this paper we calculate the analytic expression of the phase time for the scattering of an electron off a complex square barrier. As is well known the (negative) imaginary part of the potential takes into account, phenomenologically, the absorption. We investigate the so-called Hartman-Fletcher effect, and find that it is suppressed by the presence ...
RACITI, Fabio, SALESI G.
openaire +5 more sources
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
Physical Review D, 2020 For any quantum algorithm given by a path in the space of unitary operators we define the computational complexity as the typical computational time associated with the path. This time is defined using a quantum time estimator associated with the path.
openaire +3 more sources
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
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
Time complexity and gate complexity [PDF]
Physical Review A, 2010 11 pages, 6 ...
Koike, Tatsuhiko, Okudaira, Yosuke
openaire +2 more sources