Results 51 to 60 of about 1,852 (138)
Numerical Solutions to the Variational Problems by Dijkstra’s Path-Finding Algorithm
In this work, we propose the general idea of using a path-finding algorithm to solve a variational problem. By interpreting a variational problem of finding the function that minimizes a functional integral as a shortest path finding, we can apply the ...
Thanaporn Arunthong +6 more
doaj +1 more source
Proteome Analysis of Corynebacterium diphtheriae–Macrophage Interaction
ABSTRACT Contact of Corynebacterium diphtheriae with macrophages induces adaptations on both bacterial and cellular sides. The study presented here was aiming to shed light on the simultaneous intracellular adaptation of the bacteria and changes in the proteome of the phagocytes in response to the internalization of C. diphtheriae.
Luca Musella +6 more
wiley +1 more source
How to see the forest despite the trees
Abstract One of the major starting points of discrete optimization is the theorem of Nash‐Williams and Tutte on the existence of k$k$ disjoint spanning trees of a graph, along with its counterpart on the existence of k$k$ forests covering all edges of the graph.
Erika Bérczi‐Kovács, András Frank
wiley +1 more source
Abstract Accurately predicting solute transport remains a central challenge in hydrogeology due to limited data and multiscale subsurface heterogeneity. Fractional Brownian motion (fBm) is widely used to model the logarithm of hydraulic conductivity fields.
Binhao Li +2 more
wiley +1 more source
The Effective Algorithm for Navigation of Quadrotor UAV in Indoor Environment
The quadrotor is an extensively researched and popular unmanned aerial vehicle in various fields, with navigation being one of the most widely studied areas.
Van-Long Trinh, Ngoc-Tien Tran
doaj +1 more source
Adaptation Of The Variable Neighborhood Search Heuristic To Solve The Vehicle Routing Problem
The vehicle routing problem is investigated by using some adaptations of the variable neighborhood search (VNS). The initial solution was obtained by Dijkstra’s algorithm based on cost network constructed by the sweep algorithm and the 2-opt.
Arif Imran, Liane Okdinawati
doaj +1 more source
An Improved Route-Finding Algorithm Using Ubiquitous Ontology-Based Experiences Modeling
Every day, people are hired in different organizations and old and retiring employees are eliminated from enterprise systems. Eliminating these individuals from organizations leads to the loss of their spatial experiences.
Maryam Barzegar +3 more
doaj +1 more source
Algorithms for Searching the Shortest Path and Its Modification
The article presents an overview of the main trends and methods of searching the shortest path information transmission in the telecommunications networks. The basic algorithms and their modifications are described.
N. I. Listopad +2 more
doaj +2 more sources
In this article, we study the application of NetworkX, a Python library for dealing with traffic networks, to the problem of signal optimization at a single intersection.
Jovanović Aleksandar +3 more
doaj +1 more source
A graph is a diagram that contains specific information. One concept in graphs that can solve real-life problems is the concept of trees, which consists of various types of trees used to solve problems in life, such as finding the minimum path using the
LIKA HANIFA +2 more
doaj +1 more source

