Results 81 to 90 of about 190,109 (292)

Average-Case Behavior of k-Shortest Path Algorithms [PDF]

open access: yes, 2018
The k-shortest path problem is a generalization of the fundamental shortest path problem, where the goal is to compute k simple paths from a given source to a target node, in non-decreasing order of their weight. With numerous applications modeling various optimization problems and as a feature in some learning systems, there is a need for efficient ...
Alexander Schickedanz   +3 more
openaire   +1 more source

Testing a Personalized Approach to Chronic Low Back Pain: A Randomized Controlled Trial in Older Veterans

open access: yesArthritis Care &Research, EarlyView.
Objective We aimed to test the efficacy of personalized treatment of older veterans with chronic low back pain (CLBP) delivered by Aging Back Clinics (ABCs) as compared with usual care (UC). Methods Two hundred ninety‐nine veterans aged 65 to 89 with CLBP from three Veterans Affairs (VA) medical centers underwent baseline testing, randomization to ABC ...
Debra K. Weiner   +9 more
wiley   +1 more source

K connectivity algorithm based on flow network in wireless sensor networks

open access: yes物联网学报, 2019
Wireless sensor networks(WSN) connectivity is an important way to ensure network fault tolerance.Conventional multi-routing algorithms often have common paths,which will lead to premature connectivity failure of the whole WSN due to node damage ...
Jie HU, Jie ZHAN, Baoquan REN
doaj   +2 more sources

k-shortest simple paths in bounded treewidth graphs

open access: yesTheoretical Computer Science
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Coudert, David   +2 more
openaire   +2 more sources

Time-dependent stochastic shortest path(s) algorithms for a scheduled transportation network [PDF]

open access: yes, 2005
Following on from our work concerning travellers’ preferences in public transportation networks (Wu and Hartley, 2004), we introduce the concept of stochasticity to our algorithms.
Al-Dabass, D, Hartley, JK, Wu, Q
core  

High Healthcare Utilization Preceding Diagnosis with Juvenile Idiopathic Arthritis

open access: yesArthritis Care &Research, Accepted Article.
Objective Though early diagnosis improves long‐term outcomes, Juvenile Idiopathic Arthritis (JIA) patients often experience prolonged, circuitous paths to diagnosis. To inform diagnostic improvement, we sought to characterize healthcare utilization in the year preceding diagnosis.
Anna Costello   +5 more
wiley   +1 more source

Revisiting transit accessibility: effect of stochasticity, real-time information, congestion, and network structure

open access: yesJournal of Engineering and Applied Science
A novel transit accessibility measure is proposed following a utility framework to account for the stochasticity in transit services, the effect of real-time information, traffic congestion, and structural features of the transit network, which are ...
Sethu Vinayagam Udhayasekar   +2 more
doaj   +1 more source

Bistable Mechanisms 3D Printing for Mechanically Programmable Vibration Control

open access: yesAdvanced Engineering Materials, EarlyView.
This work introduces a 3D‐printed bistable mechanism integrated into tuned mass dampers (TMDs) for mechanically adaptive passive vibration suppression. Through optimized geometry, the bistable design provides adaptable vibration reduction across a broad range of scenarios, achieving effective vibration mitigation without complex controls or external ...
Ali Zolfagharian   +4 more
wiley   +1 more source

Evaluation of the Potential of Laser Shock Peening Compared with Cold Expansion for Improving Fatigue Resistance of Riveted Lap Joints of Aerospace Grade 7175 Al Alloy

open access: yesAdvanced Engineering Materials, EarlyView.
This study investigates laser shock peening for enhancing fatigue performance of riveted aerospace aluminum joints. A comparative approach with cold expansion combines fatigue testing and synchrotron X‐ray methods. Integrating mechanical testing with residual stress and strain characterization provides insights into how different treatments affect the ...
Ogün Baris Tapar   +6 more
wiley   +1 more source

Finding the K shortest hyperpaths using reoptimization [PDF]

open access: yes
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  

Home - About - Disclaimer - Privacy