Results 91 to 100 of about 1,363,530 (305)
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
Finding the Shortest-Path between two Locations [PDF]
Dijkstra's Shortest-Path Algorithm is presented and considered with examples.
Khin HlaThi
core +1 more source
Solving the Network Shortest Path Problem on a Quantum Annealer
This article addresses the formulation for implementing a single source, single-destination shortest path algorithm on a quantum annealing computer. Three distinct approaches are presented.
Thomas Krauss, Joey McCollum
doaj +1 more source
Core and Bargaining Set of Shortest Path Games [PDF]
In this paper it is shown that the core and the bargaining sets of Davis-Maschler and Zhou coincide in a class of shortest path games.Shortest path games; core; bargaining ...
Grahn, Sofia
core
On the Quadratic Shortest Path Problem [PDF]
Finding the shortest path in a directed graph is one of the most important combinatorial optimization problems, having applications in a wide range of fields. In its basic version, however, the problem fails to represent situations in which the value of the objective function is determined not only by the choice of each single arc, but also by the ...
Borzou Rostami +3 more
openaire +4 more sources
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
Parameterized Shortest Path Reconfiguration [PDF]
An st-shortest path, or st-path for short, in a graph G is a shortest (induced) path from s to t in G. Two st-paths are said to be adjacent if they differ on exactly one vertex.
Mouawad, Amer E. +4 more
core +2 more sources
This study examines how helicoidal architectures with different porosities respond to bending. Adjusting layer angle and spacing in 3D‐printed polymers reveals clear tradeoffs between stiffness, strength, and energy absorption. Experiments and simulations highlight designs that distribute stress effectively, offering pathways for optimizing lightweight
Praveenkumar Subhash Patil +2 more
wiley +1 more source
K shortest paths in stochastic time-dependent networks [PDF]
A substantial amount of research has been devoted to the shortest path problem in networks where travel times are stochastic or (deterministic and) time-dependent.
Andersen, Kim Allan +2 more
core
An oblivious shortest-path routing algorithm for fully connected cubic networks
Fully connected cubic networks (FCCNs) are a class of newly proposed hierarchical interconnection networks for multicomputer systems, which enjoy the strengths of constant node degree and good expandability.
Yang, X. +6 more
core +1 more source

