Results 21 to 30 of about 23,418,736 (380)
Application of a variational hybrid quantum-classical algorithm to heat conduction equation and analysis of time complexity [PDF]
The prosperous development of both hardware and algorithms for quantum computing (QC) potentially prompts a paradigm shift in scientific computing in various fields.
Yangyang Liu +4 more
semanticscholar +1 more source
Optimal Cooperative Driving at Signal-Free Intersections With Polynomial-Time Complexity [PDF]
Cooperative driving at signal-free intersections, which aims to improve driving safety and efficiency for connected and automated vehicles, has attracted increasing interest in recent years.
Huaxin Pei +3 more
semanticscholar +1 more source
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]
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
Time Complexity of Population-Based Metaheuristics
This paper is a brief guide aimed at evaluating the time complexity of metaheuristic algorithms both mathematically and empirically. Starting with the mathematical foundational principles of time complexity analysis, key notations and fundamental ...
Mahamed G. H. Omran, A. Engelbrecht
semanticscholar +1 more source
Performance Testing Technique for Applied Programs [PDF]
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
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
A Pseudo Random Pursuit Strategy for Atomic Clocks
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
Time Complexity of In-Memory Solution of Linear Systems [PDF]
In-memory computing (IMC) with cross-point resistive memory arrays has been shown to accelerate data-centric computations, such as the training and inference of deep neural networks, due to the high parallelism endowed by physical rules in the electrical
Zhong Sun +5 more
semanticscholar +1 more source
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

