Results 91 to 100 of about 989,695 (238)
Constrained Shortest Path Computation
, 2005 This paper proposes and solves a-autonomy and k-stops shortest path problems in large spatial databases. Given a source s and a destination d, an a-autonomy query retrieves a sequence of data points connecting s and d, such that the distance between any two consecutive points in the path is not greater than a.
TERROVITIS, Manolis +3 more
openaire +4 more sources
Analysis of Average Shortest-Path Length of Scale-Free Network
Journal of Applied Mathematics, 2013 Computing the average shortest-path length of a large scale-free network needs much memory space and computation time. Hence, parallel computing must be applied.
Guoyong Mao, Ning Zhang
doaj +1 more source
Computing Resolution-Path Dependencies in Linear Time
, 2012 The alternation of existential and universal quantifiers in a quantified boolean formula (QBF) generates dependencies among variables that must be respected when evaluating the formula. Dependency schemes provide a general framework for representing such
Slivovsky, Friedrich, Szeider, Stefan
core +1 more source
Topological Sectors and Measures on Moduli Space in Quantum Yang-Mills on a Riemann Surface
, 1996 Previous path integral treatments of Yang-Mills on a Riemann surface automatically sum over principal fiber bundles of all possible topological types in computing quantum expectations.
Fine, Dana Stanley
core +2 more sources
, 2004 We introduce the minor-closed, dual-closed class of multi-path matroids. We give a polynomial-time algorithm for computing the Tutte polynomial of a multi-path matroid, we describe their basis activities, and we prove some basic structural properties ...
Bonin, Joseph E., Gimenez, Omer
core
Path Integral Description of a Semiclassical Su-Schrieffer-Heeger Model
, 2003 The electron motion along a chain is described by a continuum version of the Su-Schrieffer-Heeger Hamiltonian in which phonon fields and electronic coordinates are mapped onto the time scale.
A.J. Heeger +25 more
core +1 more source
Computing the Extinction Path for Epidemic Models
Mathematical BiosciencesIn infectious disease modelling, the expected time from endemicity to extinction (of infection) may be analysed via WKB approximation, a method with origins in mathematical physics. The method is very general, but its uptake to date may have been limited by the practical difficulties of implementation. It is necessary to compute a trajectory of a (high
Clancy, Damian, Stewart, John J. H.
openaire +3 more sources
Secure and high throughput routing protocol with QoS constraints in cognitive wireless Mesh networks
Tongxin xuebao, 2014 A routing metric SIEB which includes link security，link conflict，link reliability and link available bandwidth was proposed.The SIEB includes link security and link performance two aspects.In order to resist various hole attack，the link trust value based
Zhu-fang KUANG +3 more
doaj +2 more sources
ORGANIZATION OF THE COMPUTATIONAL PROCESS IN SUPERCOMPUTERS WITH DYNAMICALLY CONTROLLED PARTITIONS
Современные информационные технологии и IT-образование, 2019 Worldwide interest in high-performance computing is constantly growing. It is prompted by the needs of various branches of science, education, medicine, engineering and other practical activities of mankind. This article is devoted to the organization of
Stanislav V. Nazarov, Alexey G. Barsukov
doaj +1 more source
Four-bit input linear optical quantum computing with liquid crystal devices
APL QuantumFour-bit input linear quantum computing with liquid crystal (LC) devices was studied using the Deutsch–Jozsa algorithm. A laser beam is split into four paths and passed through a configuration of twisted nematic (TN) LC device/(λ/2 waveplate)/TN LC ...
Satoshi Yokotsuka, Hiroyuki Okada
doaj +1 more source