Results 41 to 50 of about 279,848 (302)
Crown reductions for the Minimum Weighted Vertex Cover problem [PDF]
The paper studies crown reductions for the Minimum Weighted Vertex Cover problem introduced recently in the unweighted case by Fellows et al. [Blow-Ups, Win/Win's and crown rules: some new directions in FPT, in: Proceedings of the 29th International ...
Chlebikova, Janka +6 more
core +1 more source
Single‐molecule DNA flow‐stretch assays for high‐throughput DNA–protein interaction studies
We describe an optimised single‐molecule DNA flow‐stretch assay that visualises DNA–protein interactions in real time. Linear DNA fragments are tethered to a surface and stretched by buffer flow for fluorescence imaging. Using λ and φX174 DNA, this protocol enhances reproducibility and accessibility, providing a versatile approach for studying diverse ...
Ayush Kumar Ganguli +8 more
wiley +1 more source
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
Intelligent Tutoring Systems for Adult Learning in STEM Disciplines
ABSTRACT Intelligent tutoring systems (ITS) are reshaping adult learning in STEM by providing adaptive, data‐driven instruction across classrooms, workplaces, and informal environments. In the context of ITS, this article compares generative AI, which creates personalized explanations and practice materials, with explainable AI, which focuses on ...
Jill Zarestky, Amanda R. Lager Gleason
wiley +1 more source
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
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
Maximum Flow Evacuation Planning Problem with Non-Conservation Flow Constraint
The optimization model of the maximum flow evacuation planning problem efficiently sends a maximum number of evacuees along with the routes of their transshipment from the disastrous zone, the source, to the safe zone, the sink, over a given time horizon.
Bhandari, Phanindra Prasad +1 more
core +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
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

