Results 41 to 50 of about 280,639 (334)

The disjoint shortest paths problem

Discrete Applied Mathematics, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

Shortest-path problems and molecular conformation

Discrete Applied Mathematics, 1988
Given a set of experimentally determined lower and upper bounds on the distances between the atoms of a molecule, we study the minimum and maximum values that any one distance can attain when all of the remaining distances are confined between their lower and upper bounds.
Dress, Andreas, Havel, Timothy F.
openaire   +3 more sources

A Hybrid Routing Approach Using Two Searching Layers

Electrical, Control and Communication Engineering, 2021
This paper considers SUB_GOALs by using basic A* algorithm and Subgoal Graphs in a hybrid approach to execute optimal route. SUB_GOALs identified with pre-searching from basic A* at break points and Subgoal Graphs at corners of obstacles are added to ...
Koca Gonca Ozmen, Yetkin Seda
doaj   +1 more source

Dynamic Shortest Paths Methods for the Time-Dependent TSP

Algorithms, 2021
The time-dependent traveling salesman problem (TDTSP) asks for a shortest Hamiltonian tour in a directed graph where (asymmetric) arc-costs depend on the time the arc is entered.
Christoph Hansknecht, Imke Joormann, Sebastian Stiller   +2 more
doaj   +1 more source

Computing a rectilinear shortest path amid splinegons in plane

, 2017
We reduce the problem of computing a rectilinear shortest path between two given points s and t in the splinegonal domain \calS to the problem of computing a rectilinear shortest path between two points in the polygonal domain. As part of this, we define
DP Dobkin, DP Dobkin, DZ Chen, DZ Chen, DZ Chen, EA Melissaratos, H Rohnert, J Hershberger, JA Storer, JSB Mitchell, Pankaj K. Agarwal, R Bar-Yehuda, R Inkulu, S Kapoor, S Kapoor, SK Ghosh, SK Ghosh   +16 more
core   +1 more source

Efficient Pathfinding on Grid Maps: Comparative Analysis of Classical Algorithms and Incremental Line Search

IEEE Access
Pathfinding on grid maps is a cornerstone problem in robotics, autonomous navigation, and game development. Classical algorithms such as A*, Dijkstra’s, and Breadth-First Search (BFS) are known for their ability to guarantee optimal solutions ...
Amr Elshahed, Majid Khan Bin Majahar Ali, Ahmad Sufril Azlan Mohamed, Farah Aini Binti Abdullah, Ts. Lee Jian Aun   +4 more
doaj   +1 more source

Quantitative Assessment of Upper Limb Ataxia Using a Virtual Reality‐Based Evaluation System

Annals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Cerebellar ataxia impairs coordination and balance, reducing quality of life. Conventional clinical scales, including the Scale for the Assessment and Rating of Ataxia (SARA) and the International Cooperative Ataxia Rating Scale (ICARS), are widely used to assess ataxia but are limited by subjectivity and inter‐rater variability ...
Masayuki Sato, Takayuki Abe, Sho Aoki, Setsuki Tsukagoshi, Yasushi Yuminaka, Yoshio Ikeda   +5 more
wiley   +1 more source

The Application of Floyd Algorithm for Returning Path Algorithm with Constraints of Time and Limit of Load

MATEC Web of Conferences, 2016
Under ideal condition, there are lots of Shortest Path Algorithms such as Dijkstra, Floyd, Johnson algorithms. However, putting these algorithms into use is not as we expected.
Luo Jian Feng, Chen Yu Qiang
doaj   +1 more source

Exploring patients’ profiles associated with the resolution of acute calcium pyrophosphate arthritis treatedwith colchicine and prednisone: post hoc analysis of a randomized controlled trial

Arthritis Care &Research, Accepted Article.
Objective The objective was to identify factors determining acute arthritis resolution and safety with colchicine and prednisone in acute calcium pyrophosphate (CPP) crystal arthritis. Methods We conducted a post hoc analysis of the COLCHICORT trial, which compared colchicine and prednisone for the treatment of acute CPP crystal arthritis, using a ...
Tristan Pascart, Laurène Norberciak, Pascal Richette, Pierre Robinet, Aurore Pacaud, Gauthier Marchasson, Thibault Rabin, Hélène Luraschi, Pierre Maciejasz, Anne‐France Georgel, Augustin Latourte, Hang‐Korng Ea, Sébastien Ottaviani, Charlotte Jauffret, Vincent Ducoulombier   +14 more
wiley   +1 more source

A fast layered path planning algorithm for job shop scheduling problem

IET Collaborative Intelligent Manufacturing, 2022
Job shop scheduling problem (JSP) is a classical system resource optimisation problem and also an NP hard problem. The search algorithm based on Akers obstacle graph model is an effective algorithm to solve JSP, which first removes part of jobs from the ...
Lin Huang, Shikui Zhao, Qing Han
doaj   +1 more source