Results 81 to 90 of about 280,639 (334)
, 2011 We consider the problem of computing all-pairs shortest paths in a directed graph with real weights assigned to vertices. For an $n\times n$ 0-1 matrix $C,$ let $K_{C}$ be the complete weighted graph on the rows of $C$ where the weight of an edge ...
Lingas, Andrzej, Sledneu, Dzmitry
core +1 more source
Synchrotron Radiation for Quantum Technology
Advanced Functional Materials, EarlyView.Materials and interfaces underpin quantum technologies, with synchrotron and FEL methods key to understanding and optimizing them. Advances span superconducting and semiconducting qubits, 2D materials, and topological systems, where strain, defects, and interfaces govern performance.
Oliver Rader +10 more
wiley +1 more source
Frontiers in NeuroroboticsTo reduce transportation time, a discrete zeroing neural network (DZNN) method is proposed to solve the shortest path planning problem with a single starting point and a single target point.
Feifan Song +3 more
doaj +1 more source
Advanced Functional Materials, EarlyView.Cu‐based catalysts as a cornerstone in advancing sustainable energy technologies are fully reviewed in this manuscript, highlighting their potential in photo‐ and electrocatalysis. It includes metallic copper, copper oxides, copper sulfides, copper halide perovskites, copper‐based metal–organic frameworks (MOFs), and covalent organic frameworks (COFs),
Jéssica C. de Almeida +16 more
wiley +1 more source
Advanced Functional Materials, EarlyView.This work demonstrates the successful integration of a phenanthroline‐based 2D COF with MnI catalytic sites into a catholyte‐free membrane‐electrode‐assembly cell for CO2 electroreduction. The crystalline COF actively suppresses Mn⁰–Mn⁰ dimerization, achieving a turnover frequency of 617 h⁻¹ at 2.8 V (full‐cell potential), and enabling stable operation.
Laura Spies +8 more
wiley +1 more source
Approximating ATSP by Relaxing Connectivity
, 2015 The standard LP relaxation of the asymmetric traveling salesman problem has been conjectured to have a constant integrality gap in the metric case. We prove this conjecture when restricted to shortest path metrics of node-weighted digraphs. Our arguments
Svensson, Ola
core +1 more source
Advanced Functional Materials, EarlyView.Electric control of magnetic tunnel junctions offers a path to drastically reduce the energy requirements of the device. Electric field control of magnetization can be realized in a multitude of ways. These mechanisms can be integrated into existing spintronic devices to further reduce the operational energy.
Will Echtenkamp +7 more
wiley +1 more source
SOLVING QUICKEST PATH PROBLEM USING AN EXTENDED CONCEPT OF TRANSITIVE CLOSURE METHOD
Jurnal Informatika, 2005 A travel company offers a transportation service by picking up customers from certain places and sending them to the other places. Concerning traffic in time domain function for every path, the problem is how to find the quickest paths in picking up the ...
Rolly Intan
doaj
An Efficient Algorithm for Touring n Circles
MATEC Web of Conferences, 2018 This paper proposed an intelligent algorithm, which can build the shortest path of the intersecting circle sequences in the plane. The problem is transformed to a corresponding problem of computing the shortest path of three disjoint circles.
Ding Yuepeng, Xie Xiong, Jiang Bo
doaj +1 more source
Computing shortest paths in 2D and 3D memristive networks
, 2013 Global optimisation problems in networks often require shortest path length computations to determine the most efficient route. The simplest and most common problem with a shortest path solution is perhaps that of a traditional labyrinth or maze with a ...
Prodromakis, Themistoklis +2 more
core