Results 91 to 100 of about 4,817 (226)

A Novel Approach to Regionalize Country‐Level GDP Projections

open access: yesJournal of Forecasting, Volume 45, Issue 2, Page 867-879, March 2026.
ABSTRACT Socioeconomic projections are policy support tools that are often limited to country‐level data, making them insufficient for policy areas that require a more nuanced, sub‐national perspective. For granular geographical analyses in a multicountry setting, international organizations often rely on straightforward regionalization techniques ...
Riccardo Curtale   +2 more
wiley   +1 more source

The shortest-path and bee colony optimization algorithms for traffic control at single intersection with NetworkX application

open access: yesDemonstratio Mathematica
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

Some Recent Advances in Network Flows [PDF]

open access: yes, 1989
The literature on network flow problems is extensive, and over the past 40 years researchers have made continuous improvements to algorithms for solving several classes of problems.
Ahuja, Ravindra K., 1956-   +2 more
core   +1 more source

IDLB: An SDN‐Based Load‐Balancing Routing Protocol for Autonomous Satellite Constellation Networks

open access: yesInternational Journal of Satellite Communications and Networking, Volume 44, Issue 2, Page 109-127, March/April 2026.
ABSTRACT Routing in satellite constellation networks with intersatellite links has become an important aspect to enable broadband Internet access and to integrate into terrestrial networks. However, their dynamic characteristics and large physical size require specifically tailored solutions.
Manuel M. H. Roth   +4 more
wiley   +1 more source

Heuristic estimates in shortest path algorithms [PDF]

open access: yes
Shortest path problems occupy an important position in Operations Research aswell as in Arti¯cial Intelligence. In this paper we study shortest path algorithms thatexploit heuristic estimates. The well-known algorithms are put into one framework.Besides
Pijls, W.H.L.M.
core   +1 more source

An enhanced pricing model for truck transportation: a case study in Swedish forestry

open access: yesInternational Transactions in Operational Research, Volume 33, Issue 2, Page 775-797, March 2026.
Abstract Determining freight rates for heavy trucks involves a detailed analysis of multiple cost factors, including time, distance, fuel, and other operational costs, which collectively contribute to the overall compensation for transportation services. However, actual remuneration is based on more simplified agreements.
Mikael Rönnqvist   +3 more
wiley   +1 more source

Algorithms for Searching the Shortest Path and Its Modification

open access: yesЦифровая трансформация, 2016
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

Neural sensitivity to peer hierarchies: Risks for depressive symptoms for low status adolescents

open access: yesJournal of Research on Adolescence, Volume 36, Issue 1, March 2026.
Abstract Popularity is increasingly salient and impactful in adolescence, and unpopular youth are at significantly greater risk of experiencing depressive symptoms. However, adolescents can vary in their neural sensitivity to social stimuli, such that some adolescents may be more impacted by social status than others.
Jimmy Capella   +6 more
wiley   +1 more source

PENCARIAN LINTASAN TERPENDEK DENGAN ALGORITME DIJKSTRA DAN MINIMUM SPANNING TREE DENGAN ALGORITME SOLLIN TERHADAP PERJALANAN WISATA SEJARAH DI KABUPATEN SUMENEP

open access: yesE-Jurnal Matematika
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

Self-stabilizing mutual exclusion on a ring, even if K=N

open access: yes, 1999
We show that, contrary to common belief, Dijkstra's self-stabilizing mutual exclusion algorithm on a ring [Dij74,Dij82] also stabilizes when the number of states per node is one less than the number of nodes on the ring.Comment: 2 ...
Hoepman, Jaap-Henk
core   +2 more sources

Home - About - Disclaimer - Privacy