Results 311 to 320 of about 973,180 (337)
Some of the next articles are maybe not open access.
Intricacies of quantum computational paths
Quantum Information Processing, 2012Graph search represents a cornerstone in computer science and is employed when the best algorithmic solution to a problem consists in performing an analysis of a search space representing computational possibilities. Typically, in such problems it is crucial to determine the sequence of transitions performed that led to certain states.
Luís Tarrataca, Andreas Wichert
openaire +1 more source
An approximation algorithm for computing longest paths
European Journal of Operational Research, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
On computing a longest path in a tree
Information Processing Letters, 2002F. van der Sommen +5 more
openaire +2 more sources
Using Selective Path-Doubling for Parallel Shortest-Path Computations
Journal of Algorithms, 1997Summary: We consider parallel shortest-paths computations in weighted undirected graphs \(G=(V,E)\), where \(n=|V|\) and \(m=|E|\). The standard \(O(n^3)\) work path-doubling (Floyd-Warshall) algorithm consists of \(O(\log n)\) phases, where in each phase, for every triplet of vertices \((u_1, u_2, u_3) \in V^3\), the distance between \(u_1\) and \(u_3\
openaire +3 more sources
Vertical Path Guidance Computer
IEEE Transactions on Aerospace and Electronic Systems, 1970A low-cost airborne computer which provides a multiangular glide path for the landing problem is independent of ILS or GCA methods. A barometric altitude signal is divided by slant-range information from a DME interrogator. The resulting ground-based angle is subtracted from the selected approach angle to provide the displayed departure from the glide ...
openaire +2 more sources
Molecular imaging in oncology: Current impact and future directions
Ca-A Cancer Journal for Clinicians, 2022Steven P Rowe, Martin G Pomper
exaly
Dynamical memristors for higher-complexity neuromorphic computing
Nature Reviews Materials, 2022Suhas Kumar +2 more
exaly
Analogue computing with metamaterials
Nature Reviews Materials, 2021Farzad Zangeneh-Nejad +2 more
exaly
Computing Shortest Paths in Networks
1975The finding of shortest paths in networks is one of the most basic combinatorial optimization problems, and the algorithms for solving these problems are among the most widely used. The reader is probably aware that a variety of optimization problems, some of which appear to have little to do with paths in networks, can be formulated as shortest path ...
openaire +2 more sources