Results 11 to 20 of about 22,397,908 (376)
Influence Maximization: Near-Optimal Time Complexity Meets Practical Efficiency [PDF]
Given a social network G and a constant k, the influence maximization problem asks for k nodes in G that (directly and indirectly) influence the largest number of nodes under a pre-defined diffusion model.
Shi, Yanchen, Tang, Youze, Xiao, Xiaokui
core +2 more sources
MUSCLE: a multiple sequence alignment method with reduced time and space complexity [PDF]
BackgroundIn a previous paper, we introduced MUSCLE, a new program for creating multiple alignments of protein sequences, giving a brief summary of the algorithm and showing MUSCLE to achieve the highest scores reported to date on four alignment accuracy
R. C. Edgar
openalex +2 more sources
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
Complexity Leadership: On Time, On Budget [PDF]
A discursive piece aimed at practitioners in Engineering Management. On the subject of Complexity Leadership and KPIs, this short article presents three models which expand on the work of Uhl-Bien and Marion (2007) by focusing on Administrative, Enabling and Adaptive Leaderships for managing complexity.<div><br></div>
Chris Biggadike+2 more
openaire +3 more sources
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
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
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 +4 more sources
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 +6 more sources