Results 71 to 80 of about 1,615,902 (210)
A DP Approach to Hamiltonian Path Problem [PDF]
, 2013 A Dynamic Programming based polynomial worst case time and space algorithm is described for computing Hamiltonian Path of a directed graph. Complexity constructive proofs along with a tested C++ implementation are provided as well. The result is obtained
Nuriyev, Dmitriy
core
A Morphological Adaptation Approach to Path Planning Inspired by Slime Mould [PDF]
arXiv, 2015 Using a particle model of slime mould we demonstrate scoping experiments which explore how path planning may be performed by morphological adaptation. We initially demonstrate simple path planning by a shrinking blob of virtual plasmodium between two attractant sources within a polygonal arena.
arxiv
, 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
Interpreting Basis Path Set in Neural Networks [PDF]
arXiv, 2019 Based on basis path set, G-SGD algorithm significantly outperforms conventional SGD algorithm in optimizing neural networks. However, how the inner mechanism of basis paths work remains mysterious. From the aspect of graph theory, this paper defines basis path, investigates structure properties of basis paths in regular fully connected neural network ...
arxiv
Spatial Clustering Approach for Vessel Path Identification [PDF]
IEEE ACCESS, 2024This paper addresses the challenge of identifying the paths for vessels with operating routes of repetitive paths, partially repetitive paths, and new paths. We propose a spatial clustering approach for labeling the vessel paths by using only position information.
arxiv +1 more source
Faster Computation of Path-Width [PDF]
arXiv, 2016 Tree-width and path-width are widely successful concepts. Many NP-hard problems have efficient solutions when restricted to graphs of bounded tree-width. Many efficient algorithms are based on a tree decomposition. Sometimes the more restricted path decomposition is required.
arxiv
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
Shortest Paths Avoiding Forbidden Subpaths [PDF]
Proceedings of the 26th International Symposium on Theoretical
Aspects of Computer Science (STACS), Freiburg, Germany, 2009, pp. 63-74, 2008 In this paper we study a variant of the shortest path problem in graphs: given a weighted graph G and vertices s and t, and given a set X of forbidden paths in G, find a shortest s-t path P such that no path in X is a subpath of P. Path P is allowed to repeat vertices and edges.
arxiv
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
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