Results 31 to 40 of about 281,096 (215)
Neuro-Evolution of Augmenting Topologies for Dynamic Scheduling of Hybrid Flow Shop Problem
In this paper, the Neuro-Evolution of Augmenting Topologies (NEAT) algorithm is proposed to minimize the maximum completion time in a dynamic scheduling problem of hybrid flow shops.
Junjie Zhang +3 more
doaj +1 more source
ABSTRACT Background Cognitive impairment is a common non‐motor symptom in Multiple Sclerosis (MS), negatively affecting autonomy and Quality of Life (QoL). Innovative rehabilitation strategies, such as semi‐immersive virtual reality (VR) and computerized cognitive training (CCT), may offer advantages over traditional cognitive rehabilitation (TCR ...
Maria Grazia Maggio +8 more
wiley +1 more source
NEW ALGORITHM FOR SOLUTION OF MAXIMUM FLOW PROBLEM
A new algorithm for detection of a maximum flow in multi-terminal network. The algorithm is based on its matrices description and execution of ternary operations in respect of matrix elements pertaining to arc capacity.
A. D. Korznikov
doaj
This paper extends the maximum flow-covering location and service start time problem (MFCLSTP) by additionally imposing a minimum stay at a facility before the service can be used.
Ken-ichi TANAKA, Shigeki TORIUMI
doaj +1 more source
A DNA Algorithm for Calculating the Maximum Flow of a Network
DNA computing is a highly interdisciplinary field which combines molecular operations with theoretical algorithm design. A number of algorithms have been demonstrated in DNA computing, but to date network flow problems have not been studied.
Sackmann Andrea +6 more
doaj +1 more source
Early Clinical, Imaging, and Pathological Characteristics of SRPK3/TTN‐Digenic Myopathy
ABSTRACT Objective SRPK3/TTN‐digenic myopathy was recently established as a skeletal muscle myopathy caused by digenic inheritance. This study characterizes the early clinical presentation of SRPK3/TTN‐digenic myopathy in one previously reported and seven newly identified pediatric patients.
Rotem Orbach +23 more
wiley +1 more source
The maximum flow in dynamic networks [PDF]
The dynamic maximum flow problem that generalizes the static maximum flow problem is formulated and studied. We consider the problem on a network with capacities depending on time, fixed transit times on the arcs, and a given time horizon.
Maria A. Fonoberova, Dmitrii D. Lozovanu
doaj
ABSTRACT Objective Progressive brain atrophy has now been widely observed in the chronic stages of moderate–severe traumatic brain injury (msTBI), but there is only coarse information regarding its prevalence and magnitude, and whether rate of atrophy accelerates or attenuates across time. We examined these questions in a Canadian inception cohort from
Robin E. A. Green +6 more
wiley +1 more source
A bit-arc capacity scaling algorithm for the maximum flow problem subjected to box constraints on the flow vector in digraph [PDF]
A bit-arc capacity scaling algorithm to solve the maximal flow problem subjected to box constraints on the flow vector in directed network has been presented. The algorithm is mainly based on successive divisions of capacities by multiples of two.
Muhammad Tlas
doaj
Maximum Weight Scheduling Algorithm for Wireless Network Based on Congestion Control [PDF]
In wireless network,packet scheduling and congestion control are usually independently designed.This prevents the network resources from being efficiently utilized.In order to solve this problem,a new maximum weight scheduling algorithm based on ...
CHEN Chixin,ZHOU Jipeng
doaj +1 more source

