Results 41 to 50 of about 1,363,530 (305)

Genetic algorithms with immigrants and memory schemes for dynamic shortest path routing problems in mobile ad hoc networks [PDF]

open access: yes, 2010
This article is posted here with permission of IEEE - Copyright @ 2010 IEEEIn recent years, the static shortest path (SP) problem has been well addressed using intelligent optimization techniques, e.g., artificial neural networks, genetic algorithms (GAs)
Yang, S   +5 more
core   +1 more source

Reconstructing enzyme evolution by protein engineering

open access: yesFEBS Letters, EarlyView.
Natural enzyme evolution can be retraced by protein engineering methods such as directed evolution, rational design, and ancestral sequence reconstruction. These approaches reveal how enzymes emerged from ligand‐binding scaffolds, developed varying substrate preferences, formed oligomeric complexes, adapted to environmental changes, and evolved novel ...
Lukas Drexler   +2 more
wiley   +1 more source

PSPCM shortest path computation.

open access: yes, 2022
PSPCM shortest path computation.
Innocent Uzougbo Onwuegbuzie (9243166)   +4 more
core   +1 more source

Structure‐forward targeting of claudins with synthetic binders

open access: yesFEBS Letters, EarlyView.
Claudins form the paracellular barriers between epithelial and endothelial tissues at tight junctions and are targets for molecular binders with the goal of modulating barrier permeability. Claudin‐binding molecules are relevant in drug delivery or in altering claudin interactions with disease‐causing proteins.
Alex J. Vecchio
wiley   +1 more source

Geometric organization and inference of shortest path nodes in soft random geometric graphs

open access: yesPhysical Review Research
The shortest path problem is related to many dynamic processes on networks, ranging from routing in communication networks to signaling in molecular interaction networks.
Zhihao Qiu   +4 more
doaj   +1 more source

Path planning of a mobile robot among curved obstacles through tangent drawing and trapezoidal decomposition

open access: yesEngineering Science and Technology, an International Journal, 2021
Most of the previous studies on mobile robot path planning consider the obstacles as polygons. However, the complex shaped obstacles should be considered as curves rather than polygons, since the latter may result in non-optimal paths.
Neeta A. Eapen
doaj   +1 more source

Time-dependent stochastic shortest path(s) algorithms for a scheduled transportation network [PDF]

open access: yes, 2005
Following on from our work concerning travellers’ preferences in public transportation networks (Wu and Hartley, 2004), we introduce the concept of stochasticity to our algorithms.
Wu, Q, Al-Dabass, D, Hartley, JK
core  

Autophagy and mitophagy in pancreatic β‐cell homeostasis and their involvement in diabetes pathophysiology

open access: yesFEBS Letters, EarlyView.
This review focuses on the role of autophagy and mitophagy in maintaining pancreatic β‐cell function and homeostasis. We discuss how genetic defects affecting these pathways contribute to the development of type 1, type 2, monogenic, and gestational diabetes. We further explore their potential as therapeutic targets. Created in BioRender.
Yunkyeong Lee   +2 more
wiley   +1 more source

Faster algorithms for shortest path and network flow based on graph decomposition

open access: yesJournal of Graph Algorithms and Applications, 2019
We propose faster algorithms for the maximum flow problem and shortest path problems based on graph decomposition. Our algorithms first construct indices (data structures) from a given graph, then use them for solving the problems.
Manas Jyoti Kashyop   +2 more
doaj   +1 more source

Complexity of the Temporal Shortest Path Interdiction Problem [PDF]

open access: yes, 2023
In the shortest path interdiction problem, an interdictor aims to remove arcs of total cost at most a given budget from a directed graph with given arc costs and traversal times such that the length of a shortest s-t-path is maximized. For static graphs,
Wittmann, Alina   +2 more
core   +1 more source

Home - About - Disclaimer - Privacy