Results 91 to 100 of about 524,063 (295)
Finding the K shortest hyperpaths using reoptimization [PDF]
The shortest hyperpath problem is an extension of the classical shortest path problem and has applications in many different areas. Recently, algorithms for finding the K shortest hyperpaths in a directed hypergraph have been developed by Andersen ...
Andersen, Kim Allan +2 more
core
Arthritis Care &Research, EarlyView.Objective The objective of this article is to identify perceptions of patients with systemic lupus erythematosus (SLE) regarding artificial intelligence (AI)–based online symptom assessment tools, and the potential of these tools to address diagnostic barriers.
Olivia A. Stein +7 more
wiley +1 more source
Computing all shortest passenger routes with a tropical Dijkstra algorithm
EURO Journal on Transportation and LogisticsGiven a public transportation network, which and how many passenger routes can potentially be shortest paths, when all possible timetables are taken into account?
Berenike Masing +2 more
doaj +1 more source
Observer of changes in the forest of the shortest paths on dynamic graphs of transport networks
Доклады Белорусского государственного университета информатики и радиоэлектроники, 2020 The purpose of the work is the development of basic data structures, speed-efficient and memoryefficient algorithms for tracking changes in predefined decisions about sets of shortest paths on transport networks, notifications about which are received by
N. V. Khajynova +2 more
doaj +1 more source
Arthritis Care &Research, EarlyView.Objective Systemic lupus erythematosus (SLE) significantly impacts employment capacity. This study aimed to investigate the impact of burden of disease activity, damage, and treatment on employment outcomes and transitions in patients with SLE. Methods Using data from a single center, we analyzed employment transitions, adjusted mean disease activity ...
Javier Mencia‐Ledo +4 more
wiley +1 more source
An Efficient Approximation of Betweenness Centrality for Uncertain Graphs
IEEE Access, 2019 Betweenness centrality measures the centrality of nodes and edges in a graph based on the concept of shortest paths. However, such a definition is unsuitable for uncertain graphs due to the uncertainty of links. In the possible-world semantics, the Monte
Chenxu Wang, Ziyuan Lin
doaj +1 more source
Fostering Innovation: Streamlining Magnetocaloric Materials Research by Digitalization
Advanced Engineering Materials, EarlyView.Magnetocaloric cooling (MCE) is an environmentally friendly refrigeration method with great potential. Optimizing MCE materials involves the preparation and screening of large quantities of samples, which in turn generates a large amount of data. A digitalization approach is presented that uses ontologies, knowledge graphs, and digital workflows to ...
Simon Bekemeier +17 more
wiley +1 more source
Shortest path counting in probabilistic biological networks
BMC Bioinformatics, 2018 Background Biological regulatory networks, representing the interactions between genes and their products, control almost every biological activity in the cell.
Yuanfang Ren, Ahmet Ay, Tamer Kahveci
doaj +1 more source
An Auction Algorithm for Shortest Paths [PDF]
SIAM Journal on Optimization, 1991 Summary: A new and simple algorithm for finding shortest paths in a directed graph is proposed. In the single origin-single destination case, the algorithm maintains a single path starting at the origin, which is extended or contracted by a single node at each iteration.
openaire +3 more sources
Yet another bidirectional algorithm for shortest paths [PDF]
For finding a shortest path in a network the bidirectional~A* algorithm is a widely known algorithm. An A* instance requires a heuristic estimate, a real-valued function on the set of nodes.
Post, H., Pijls, W.H.L.M.
core