Results 81 to 90 of about 1,615,902 (210)

Computing Tutte Paths [PDF]

arXiv, 2017
Tutte paths are one of the most successful tools for attacking Hamiltonicity problems in planar graphs. Unfortunately, results based on them are non-constructive, as their proofs inherently use an induction on overlapping subgraphs and these overlaps hinder to bound the running time to a polynomial.
arxiv  

Comment on a computing the k shortest paths in a graph [PDF]

, 1977
Eugene L. Lawler
openalex   +1 more source

Path-Adaptive Matting for Efficient Inference Under Various Computational Cost Constraints [PDF]

arXiv
In this paper, we explore a novel image matting task aimed at achieving efficient inference under various computational cost constraints, specifically FLOP limitations, using a single matting network. Existing matting methods which have not explored scalable architectures or path-learning strategies, fail to tackle this challenge.
arxiv  

Lower bounds for computing geometric spanners and approximate shortest paths [PDF]

, 2001
Danny Z. Chen, Gautam Das, Michiel Smid
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, Suhadi, Freddy Permana Zen   +2 more
doaj   +1 more source

Hybrid Path Planning Algorithm Based on Membrane Pseudo-Bacterial Potential Field for Autonomous Mobile Robots

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, Kenia Picos, Oscar Montiel   +2 more
doaj   +1 more source

A Template for Implementing Fast Lock-free Trees Using HTM [PDF]

arXiv, 2017
Algorithms that use hardware transactional memory (HTM) must provide a software-only fallback path to guarantee progress. The design of the fallback path can have a profound impact on performance. If the fallback path is allowed to run concurrently with hardware transactions, then hardware transactions must be instrumented, adding significant overhead.
arxiv  

Computing MDP cost function for high speed networks with sample-path and quantization [PDF]

, 2001
Xi‐Ren Cao, Junjie Wang, Chin‐Tau Lea   +2 more
openalex   +1 more source

Path planning using optically computed potential fields [PDF]

, 2002
Max B. Reid
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