Results 41 to 50 of about 286,038 (288)
Generalized Shortest Path Kernel on Graphs
, 2015 We consider the problem of classifying graphs using graph kernels. We define a new graph kernel, called the generalized shortest path kernel, based on the number and length of shortest paths between nodes.
A Fronczak +6 more
core +1 more source
A Sidetrack-Based Algorithm for Finding the k Shortest Simple Paths in a Directed Graph [PDF]
, 2016 We present an algorithm for the k shortest simple path problem on weighted directed graphs (kSSP) that is based on Eppstein's algorithm for a similar problem in which paths are allowed to contain cycles.
Kurz, Denis, Mutzel, Petra
core +2 more sources
FEBS Open Bio, EarlyView.This protocol paper outlines methods to establish the success of a time‐resolved serial crystallographic experiment, by means of statistical analysis of timepoint data in reciprocal space and models in real space. We show how to amplify the signal from excited states to visualise structural changes in successful experiments.
Jake Hill +4 more
wiley +1 more source
MATEC Web of Conferences, 2016 Under ideal condition, there are lots of Shortest Path Algorithms such as Dijkstra, Floyd, Johnson algorithms. However, putting these algorithms into use is not as we expected.
Luo Jian Feng, Chen Yu Qiang
doaj +1 more source
A fast layered path planning algorithm for job shop scheduling problem
IET Collaborative Intelligent Manufacturing, 2022 Job shop scheduling problem (JSP) is a classical system resource optimisation problem and also an NP hard problem. The search algorithm based on Akers obstacle graph model is an effective algorithm to solve JSP, which first removes part of jobs from the ...
Lin Huang, Shikui Zhao, Qing Han
doaj +1 more source
High Health Care Utilization Preceding Diagnosis With Juvenile Idiopathic Arthritis
Arthritis Care &Research, EarlyView.Objective Although early diagnosis improves long‐term outcomes, patients with juvenile idiopathic arthritis (JIA) often experience prolonged, circuitous paths to diagnosis. To inform diagnostic improvement, we sought to characterize health care utilization in the year preceding diagnosis. Methods We identified 10,021 patients with an incident diagnosis
Anna Costello +5 more
wiley +1 more source
The Stochastic Shortest Path Problem : A polyhedral combinatorics perspective
, 2017 In this paper, we give a new framework for the stochastic shortest path problem in finite state and action spaces. Our framework generalizes both the frameworks proposed by Bertsekas and Tsitsikli and by Bertsekas and Yu.
Guillot, Matthieu, Stauffer, Gautier
core +3 more sources
Advanced Engineering Materials, EarlyView.Collagen hydrolysate is evaluated as a sustainable binder for MgO‐C refractories. Its thermally induced cross‐linking and gas release lead to expansion and cracking in large bricks, but tailored batches with lignin, recyclates, or fine graphite improve the gas release while thermal treatment and stability.
Till M. J. Stadtmüller +8 more
wiley +1 more source
Randomized Shortest-Path Problems: Two Related Models [PDF]
Neural Computation, 2009 This letter addresses the problem of designing the transition probabilities of a finite Markov chain (the policy) in order to minimize the expected cost for reaching a destination node from a source node while maintaining a fixed level of entropy spread throughout the network (the exploration). It is motivated by the following scenario.
Saerens, Marco +3 more
openaire +3 more sources
Advanced Engineering Materials, EarlyView.Additive manufacturing provides precise control over the placement of continuous fibres within polymer matrices, enabling customised mechanical performance in composite components. This article explores processing strategies, mechanical testing, and modelling approaches for additive manufactured continuous fibre‐reinforced composites.
Cherian Thomas, Amir Hosein Sakhaei
wiley +1 more source