Results 91 to 100 of about 5,064,874 (383)
A Global Path Planning Algorithm Based on Bidirectional SVGA
Journal of Robotics, 2017 For path planning algorithms based on visibility graph, constructing a visibility graph is very time-consuming. To reduce the computing time of visibility graph construction, this paper proposes a novel global path planning algorithm, bidirectional SVGA (
Taizhi Lv, Chunxia Zhao, Jiancheng Bao
doaj +1 more source
Maximum Flux Transition Paths of Conformational Change
, 2010 Given two metastable states A and B of a biomolecular system, the problem is to calculate the likely paths of the transition from A to B. Such a calculation is more informative and more manageable if done for a reduced set of collective variables chosen ...
Berkowitz M. +40 more
core +1 more source
Rewriting and Completeness of Sum-Over-Paths in Dyadic Fragments of Quantum Computing [PDF]
, 2023 Renaud Vilmart
openalex +1 more source
Path integral computation of phonon anharmonicity [PDF]
The European Physical Journal B, 2004 The partition function of an oscillator disturbed by a set of electron particle paths has been computed by a path integral method which permits to evaluate at any temperature the relevant cumulant terms in the series expansion. The time dependent source current peculiar of the semiclassical Su-Schrieffer-Heeger model induces large electron-phonon ...
openaire +2 more sources
Enzymatic degradation of biopolymers in amorphous and molten states: mechanisms and applications
FEBS Open Bio, EarlyView.This review explains how polymer morphology and thermal state shape enzymatic degradation pathways, comparing amorphous and molten biopolymer structures. By integrating structure–reactivity principles with insights from thermodynamics and enzyme engineering, it highlights mechanisms that enable efficient polymer breakdown.
Anđela Pustak, Aleksandra Maršavelski
wiley +1 more source
A Scheduling Algorithm for Cloud Computing System Based on the Driver of Dynamic Essential Path. [PDF]
PLoS ONE, 2016 To solve the problem of task scheduling in the cloud computing system, this paper proposes a scheduling algorithm for cloud computing based on the driver of dynamic essential path (DDEP).
Zhiqiang Xie, Xia Shao, Yu Xin
doaj +1 more source
High Performance Computing Simulation of Intelligent Logistics Management Based on Shortest Path Algorithm [PDF]
, 2022 Zongchao Wei
openalex +1 more source
DNA Computing the Hamiltonian Path Problem
Molecules and Cells, 1999 The directed Hamiltonian path (DHP) problem is one of the hard computational problems for which there is no practical algorithm on a conventional computer available. Many problems, including the traveling sales person problem and the longest path problem, can be translated into the DHP problem, which implies that an algorithm for DHP can also solve all
C M, Lee, S W, Kim, S M, Kim, U, Sohn
openaire +2 more sources
FEBS Open Bio, EarlyView.Unique biological samples, such as site‐specific mutant proteins, are available only in limited quantities. Here, we present a polarization‐resolved transient infrared spectroscopy setup with referencing to improve signal‐to‐noise tailored towards tracing small signals. We provide an overview of characterizing the excitation conditions for polarization‐
Clark Zahn, Karsten Heyne
wiley +1 more source
Computing Resolution-Path Dependencies in Linear Time
, 2012 The alternation of existential and universal quantifiers in a quantified boolean formula (QBF) generates dependencies among variables that must be respected when evaluating the formula. Dependency schemes provide a general framework for representing such
Slivovsky, Friedrich, Szeider, Stefan
core +1 more source