Results 51 to 60 of about 15,993 (171)
ABSTRACT This study explores how digital dynamic capabilities (DDC)—specifically digital absorptive capacity (DAC) and digital transformation capacity (DTC)—contribute to environmental sustainability (ES), both directly and through circular supply chain practices (CSCP).
Yi Liang, Tae‐Hoo Kim, Min‐Jae Lee
wiley +1 more source
Recent Application of Dijkstra’s Algorithm in the Process of Production Planning
This paper aims to develop a method that could serve as a tool for evaluating extracted raw materials in terms of use by considering the place of extraction and consumption.
Marcel Behún +4 more
doaj +1 more source
Non‐Uniform Programmable Photonic Waveguide Meshes
Integrating defect cells into uniform hexagonal waveguide meshes overcomes the fundamental spectral and temporal limitations of programmable photonics. By leveraging the Vernier effect through non‐uniform coupled cavities, this architecture achieves a tenfold increase in free spectral range and ultra‐fast sampling times, paving the way for next ...
Cristina Catalá‐Lahoz, José Capmany
wiley +1 more source
Causal Domain Restriction for Eikonal Equations
Many applications require efficient methods for solving continuous shortest path problems. Such paths can be viewed as characteristics of static Hamilton-Jacobi equations.
Chacon, Adam +2 more
core +1 more source
An Exact Method for Reliable Shortest Path Problems With Correlation
ABSTRACT Shortest path problems often arise in contexts where travel times are uncertain. In these settings, reliable paths are often valued more than paths with lower expected travel times. This has led to several variants of reliable shortest path problems (RSPP) that handle travel time reliability differently. We propose an algorithmic framework for
Esteban Leiva +3 more
wiley +1 more source
Potential of Using the Ant Colony Optimization Algorithm for Optimal Network Path Selection
The article considers the possibilities of using the Ant Colony Optimization algorithm to find the shortest path in the network based on the selected criteria. Its performance is compared to Dijkstra's algorithm and LCA algorithm, which is widely used in
Oleksandra Yaroshevska, Veronika Kirova
doaj +1 more source
A QUANTUM IMPROVEMENT ON DIJKSTRA’S ALGORITHM FOR COMPUTER NETWORK ROUTING [PDF]
The aim of this paper is to improve the Dijkstra algorithm which is widely used in the internet routing. Quantum computing approach is used to improve the work of Dijkstra algorithm for network routing by exploiting the massive parallelism existing in ...
Rana F. Ghani, Ahmed T. Sadik
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
ABSTRACT This work presents a non‐geometrical navigation approach based on a purely topological understanding of underground environments. By conceptualizing subterranean scenarios as a set of tunnels that intersect with each other, and taking a navigation approach based on topological instructions, we simplify the navigation problem to the sequential ...
Lorenzo Cano +2 more
wiley +1 more source
Path‐Based Deep Reinforcement Learning for On‐Board Routing in Satellite Constellation Networks
ABSTRACT Efficient usage of available network resources is a crucial factor for broadband services in interconnected satellite constellations. To meet required quality of service standards under heavy network loads, it is essential to optimize traffic distribution among the intersatellite links. To address this challenge, we propose an adaptive traffic
Manuel M. H. Roth +4 more
wiley +1 more source

