Results 331 to 340 of about 5,064,874 (383)
Some of the next articles are maybe not open access.

Path-integral computations of tunneling processes

The Journal of Chemical Physics, 2005
The application of the path-integral methodology of Chandler and Wolynes [D. Chandler and P. G. Wolynes, J. Chem. Phys. 74, 4078 (1981)] to the calculation of one-electron-tunneling probabilities is revisited. We show that the evaluation of the kink free energy that is related to the tunneling splitting is associated with “polymer bead” distributions ...
Ilan, Benjamin, Abraham, Nitzan
openaire   +2 more sources

Path-integral computation of superfluid densities

Physical Review B, 1987
The normal and superfluid densities are defined by the response of a liquid to sample boundary motion. The free-energy change due to uniform boundary motion can be calculated by path-integral methods from the distribution of the winding number of the paths around a periodic cell.
, Pollock, , Ceperley
openaire   +2 more sources

Using Selective Path-Doubling for Parallel Shortest-Path Computations

Journal of Algorithms, 1997
Summary: 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   +1 more source

Completion Time and Energy Optimization in the UAV-Enabled Mobile-Edge Computing System

IEEE Internet of Things Journal, 2020
Completion time and energy consumption of the unmanned aerial vehicle (UAV) are two important design aspects in UAV-enabled applications. In this article, we consider a UAV-enabled mobile-edge computing (MEC) system for Internet-of-Things (IoT ...
Cheng Zhan   +4 more
semanticscholar   +1 more source

Fastest-Path Computation

2008
Definition In the United states, only 9.3% of the households do not have cars. Driving is part of people’s daily life. GIS systems like MapQuest and MapPoint are heavily relied on to provide driving directions. However, surprisingly enough, existing systems either ignore the driving speed on road networks, or assume the speed remains constant on the ...
openaire   +1 more source

Crowdsourcing computing resources for shortest-path computation

Proceedings of the 20th International Conference on Advances in Geographic Information Systems, 2012
Crowdsourcing road network data, i.e., involving users to collect data including the detection and assessment of changes to the road network graph, poses a challenge to shortest-path algorithms that rely on preprocessing. Hence, current research challenges lie with improving performance by adequately balancing preprocessing with respect to fast ...
Efentakis A., Theodorakis D., Pfoser D.
openaire   +1 more source

Vertical Path Guidance Computer

IEEE Transactions on Aerospace and Electronic Systems, 1970
A 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   +1 more source

Computational crack path prediction

Theoretical and Applied Fracture Mechanics, 1985
Abstract A computer program has been developed for the numerical prediction of curved crack growth paths under proportional loading conditions. The numerical prediction is performed by the step-by-step method in cooperation with the stress analysis ahead of the crack tip and the determination of the curved increment of the crack growth.
openaire   +1 more source

Computing almost shortest paths

ACM Transactions on Algorithms, 2001
We study the <i>s-sources almost shortest paths</i> (abbreviated <i>s-ASP</i>) problem. Given an unweighted graph <i>G</i> &equals; (<i>V,E</i>), and a subset <i>S</i> &sube; <i>V</i> of <i>s</i> nodes, the goal is to compute almost shortest paths between all ...
openaire   +1 more source

Path length statistics in reservoir computers

Chaos: An Interdisciplinary Journal of Nonlinear Science, 2020
Because reservoir computers are high dimensional dynamical systems, designing a good reservoir computer is difficult. In many cases, the designer must search a large nonlinear parameter space, and each step of the search requires simulating the full reservoir computer.
openaire   +3 more sources

Home - About - Disclaimer - Privacy