Results 51 to 60 of about 4,841 (225)

Exploring the Spillover Effect of Supply Chain Digitalisation on Pollution Emissions Through Social Network Analysis

Business Strategy and the Environment, EarlyView.
ABSTRACT The supply chain consists of interconnected businesses and organisations responsible for the flow of goods and services. As firms increasingly adopt digital technologies, the spillover effects of supply chain digitalisation (SCD) on environmental performance remain underexplored.
Zengdong Cao, Nichola Latoya Williams, Ibrahim Labaran Ali, Ololade Periola, Yasanur Kayikci   +4 more
wiley   +1 more source

Strategic Impact of EU Taxonomy on Pharmaceutical Firms' Performance

Business Strategy and the Environment, EarlyView.
ABSTRACT Sustainability has become a central concern in economic policy and corporate governance, increasingly formalised through regulatory frameworks of the European Union (EU). The European Commission has published the EU Taxonomy, which allows economic activities and their contribution to sustainability to be analysed, taking into account ...
Alicia Ramírez‐Orellana, Cristina Blanco González‐Tejero, Silvia Giralt Escobar, Antonio Garcia‐Amate   +3 more
wiley   +1 more source

A Comparison of Data Structures for Dijkstra's Single Source Shortest Path Algorithm [PDF]

, 1999
Dijkstra's algorithm computes the shortest paths between a starting vertex and each other vertex in a directed graph. The performance of Dijkstra's algorithm depends on how it is implemented. This mainly relates to the type of data structure used for the
Saunders, Shane
core  

Path Selection for Quantum Repeater Networks

, 2012
Quantum networks will support long-distance quantum key distribution (QKD) and distributed quantum computation, and are an active area of both experimental and theoretical research.
A Basu, A Fedrizzi, A G Fowler, A K Ekert, A Medina, A Mink, C Elliott, C Franco Di, C H Bennett, C H Bennett, C-W Chou, D Copsey, D Dodson, E D’Hondt, E W Dijkstra, H Buhrman, H J Kimble, H-J Briegel, H-K Lo, J D Touch, J Dehaene, J Moy, L Childress, L Hartmann, L Jiang, L Jiang, M Ben-Or, M Oskin, M Peev, N Isailovic, P Loock van, P Villoresi, R Alléaume, R Govindan, R Meter Van, R Meter Van, R Reichle, S Bratzik, S Lloyd, S Nagayama, S Tani, T D Ladd, T S Metodi, T Scheidl, T Tashima, T-Y Chen, W Dür, W J Munro, W J Munro, W K Wootters, Z Zhao   +50 more
core   +1 more source

Dynamic Scope-Based Dijkstra's Algorithm

, 2012
We briefly report on the current state of a new dynamic algorithm for the route planning problem based on a concept of scope (the static variant presented at ESA'11, HM2011A). We first motivate dynamization of the concept of scope admissibility, and then we briefly describe a modification of the scope-aware query algorithm of HM2011A to dynamic road ...
Hlineny, Petr, Moris, Ondrej
openaire   +2 more sources

Non‐Uniform Programmable Photonic Waveguide Meshes

Laser &Photonics Reviews, EarlyView.
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

A Practically Efficient Algorithm for Generating Answers to Keyword Search over Data Graphs [PDF]

, 2015
In keyword search over a data graph, an answer is a non-redundant subtree that contains all the keywords of the query. A naive approach to producing all the answers by increasing height is to generalize Dijkstra's algorithm to enumerating all acyclic ...
Golenberg, Konstantin, Sagiv, Yehoshua
core   +2 more sources

An Exact Method for Reliable Shortest Path Problems With Correlation

Networks, EarlyView.
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, Santiago Morales, Daniel Yamín, Andrés L. Medaglia   +3 more
wiley   +1 more source

Potential of Using the Ant Colony Optimization Algorithm for Optimal Network Path Selection

Proceedings of the International Conference on Applied Innovations in IT
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

Method of Path Selection in the Graph - Case Study [PDF]

TransNav, 2014
This paper presents a different perspective on the Dijkstra algorithm. In this paper algorithm will be used in the further analysis to find additional paths between nodes in the maritime sector.
Tomasz Neumann
doaj   +1 more source