Results 101 to 110 of about 989,695 (238)
Comment on a computing the k shortest paths in a graph [PDF]
, 1977 Eugene L. Lawler
openalex +1 more source
Path Independence in Adiabatic Quantum Computing for Hadamard Gate
Journal of Mathematical and Fundamental Sciences, 2014 The computation time in adiabatic quantum computing (AQC) is determined by the time limit of the adiabatic evolution, which in turn depends on the evolution path. In this research we have used the variational method to find an optimized path.
Jusak Sali Kosasih +2 more
doaj +1 more source
Lower bounds for computing geometric spanners and approximate shortest paths [PDF]
, 2001 Danny Z. Chen, Gautam Das, Michiel Smid
openalex +1 more source
On Computing the Path Number of a Graph
Electronic Notes in Theoretical Computer Science, 2019 Abstract Gallai (1966) conjectured that the edge set of every graph G on n vertices can be covered by at most ⌈n/2⌉ edge-disjoint paths. Such a covering by edge-disjoint paths is called a path decomposition, and the size of a path decomposition with a minimum number of elements is called the path number of G. Peroche (1984) proved that the problem of
Rafael G. Cano +2 more
openaire +2 more sources
IEEE Access, 2019 A hybrid path planning algorithm based on membrane pseudo-bacterial potential field (MemPBPF) is proposed. Membrane-inspired algorithms can reach an evolutionary behavior based on biochemical processes to find the best parameters for generating a ...
Ulises Orozco-Rosas +2 more
doaj +1 more source
Computing MDP cost function for high speed networks with sample-path and quantization [PDF]
, 2001 Xi‐Ren Cao +2 more
openalex +1 more source
Orthophoto Classification for UGV Path Planning using Heterogeneous Computing
International Journal of Advanced Robotic Systems, 2013 We have developed a system that uses aerial imagery for improving unmanned ground vehicle navigation capabilities. The current article focuses on the viability of using heterogeneous computing architecture for improving system performance in terms of ...
Robert Hudjakov, Mart Tamre
doaj +1 more source
An efficient method for computing exact path delay fault coverage [PDF]
, 2002 B. Kapoor
openalex +1 more source
Path planning using optically computed potential fields [PDF]
, 2002 Max B. Reid
openalex +1 more source
VHSAP-based approach of defending against DDoS attacks for cloud computing routing platforms
Tongxin xuebao, 2015 Based on the analysis of security overlay service (SOS) approach of defending against DDoS attacks in large scale network,the vulnerability in the exit mechanism of being attacked nodes in SOS approach is explored.The vulnerability is solved by improving
UZhi-jun W, UIYi C, UEMeng Y
doaj +2 more sources