Results 71 to 80 of about 1,003,319 (338)

Finding Shortest Paths With Computational Geometry [PDF]

Journal of Graph Algorithms and Applications, 2003
Summary: We present a heuristic search algorithm for the \(\mathbb R^d\) Manhattan shortest path problem that achieves front-to-front bidirectionality in subquadratic time. In the study of bidirectional search algorithms, front-to-front heuristic computations were thought to be prohibitively expensive (at least quadratic time complexity); our algorithm
openaire   +1 more source

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

When the path is never shortest: a reality check on shortest path biocomputation

, 2017
Shortest path problems are a touchstone for evaluating the computing performance and functional range of novel computing substrates. Much has been published in recent years regarding the use of biocomputers to solve minimal path problems such as route ...
A Adamatzky, A Adamatzky, A Adamatzky, A. Tero, Andrew Adamatzky, C Scherber, CD Harvey, CR Reid, IH Riedel-Kruse, J Baumgardner, J Houten Van, J Houten Van, J Jones, Jeff Jones, K Ramsch, K Vittori, L Zhu, M Dorigo, M Vela-Pérez, Michael Esau, R Mayne, R Mayne, R Mayne, Richard Mayne, S Stepney, Saikat Jana, SC Pratt, T Hennessey, T Nakagaki   +28 more
core   +1 more source

Understanding bio‐based polymers: A study of origins, properties, biodegradation and their impact on health and the environment

FEBS Open Bio, EarlyView.
This review provides an overview of bio‐based polymer sources, their unique functional properties and their environmental impact, and addresses their role as sustainable alternatives. It discusses end‐of‐life options, including composting and anaerobic digestion for renewable energy.
Sabina Kolbl Repinc, Blaž Stres, Mirica Karlovits, Igor Karlovits, Petra Jerič, Ondrej Panák, Anja Verbič, Blaž Likozar, Uroš Novak   +8 more
wiley   +1 more source

Delay constraint minimum interruption routing algorithm for mobile satellite network

Tongxin xuebao, 2006
By the analysis of the characteristics of mobile satellite network,such as a long delay and a topological time-varying,a novel satellite network delay constraint optimal path（SDCOP）algorithm,which could obtain a path to sat-isfy the delay constraint ...
ZHANG Tao, LIU Zhong-kan, ZHANG Jun
doaj   +2 more sources

Optimal time reuse strategy-based dynamic multi-AGV path planning method

Complex & Intelligent Systems
The window strategy, known for its flexibility and efficiency, is extensively used in dynamic path planning. To further enhance the performance of the Automated Guided Vehicles (AGVs) sorting system, the two processes of AGV movement and path planning ...
Ke Wang, Wei Liang, Huaguang Shi, Jialin Zhang, Qi Wang   +4 more
doaj   +1 more source

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

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

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., Bolhuis P. G., Bolhuis P. G., Brooks B. R., Brooks B. R., Chu J., Crehuet R., E W., E W., E, W., Elber R., Essmann U., Frenkel D., Gan W., Huang H., Huo S., Jiménez A., Jorgensen W. L., Jónsson H., Lei M., Ma A., MacKerell A. D., Mackerell, Jr A. D., Maragliano L., Metzner P., Onsager L., Ozkirimli E., Ozkirimli E., Pan A. C., Park S., Phillips J. C., Ren W., Ryckaert J.-P., Schlitter J., Singhal N., Vanden-Eijnden E., Vanden-Eijnden E., Vanden-Eijnden E., Vanden-Eijnden E., Yang S., Zhang J.   +40 more
core   +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