Results 51 to 60 of about 4,817 (226)

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

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

Multi-criteria path rationalization in the conditions of multi-type passenger transport systems

Вестник университета, 2021
The article proposes methods of searching passenger travel routes in conditions where one or more optimization criteria must be taken into account in the presence of a pedestrian system and multi-type transport systems with their topologies, sets of ...
V. V. Egorov
doaj   +1 more source

Synchronisation of Extreme Precipitation and Sea Surface Temperature Events in the Northern Hemisphere: A Complex Network Approach

International Journal of Climatology, EarlyView.
Using complex network theory and event synchronisation, we find distinct spatiotemporal structures of extreme precipitation and sea surface temperature events across the Northern Hemisphere. Our results show strong local and long‐range connectivity in terrestrial extremes, driven by atmospheric dynamics, contrasting with more localised marine extremes ...
Connor Saari, Jürgen Kurths, Gabriele Villarini, Behzad Ghanbarian   +3 more
wiley   +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

Impacts of Biostimulants on Nitrous Oxide Emissions and the Soil Microbiome

Journal of Plant Nutrition and Soil Science, EarlyView.
Soil incubation experiment examining the influence of biostimulants on greenhouse gas emissions and the soil microbiome in fertilized soils. ABSTRACT Background Overapplication of nitrogenous fertilizer and enhanced microbial activity in agricultural soils are drivers of increasing greenhouse gas emissions.
Conor Blunt, Sean Storey, Andrea Fuchs, Rainer Melzer, Grace M. Cott   +4 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

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