Results 111 to 120 of about 4,919,639 (299)

Factors Associated With the Rising Trend in Self‐Reported Cognitive Disability Among U.S. Adults Aged 18–39 From 2013–2024

Annals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Building on our prior Behavioral Risk Factor Surveillance System analysis identifying adults aged 18–39 as the primary driver of the national increase in self‐reported cognitive disability, we examined factors associated with this rise using 2013–2024 U.S. BRFSS data. Methods We analyzed U.S.
Adam de Havenon, Ka‐Ho Wong, Mirriam Mananah, Christopher D. Anderson, Ada Fenick, Amy Arnsten, Arman Fesharaki‐Zadeh, James C. McPartland, Mary L. Adams, Kevin N. Sheth   +9 more
wiley   +1 more source

Transfer Reinforcement Learning for Combinatorial Optimization Problems

Algorithms
Reinforcement learning is an important technique in various fields, particularly in automated machine learning for reinforcement learning (AutoRL).
Gleice Kelly Barbosa Souza, Samara Oliveira Silva Santos, André Luiz Carvalho Ottoni, Marcos Santos Oliveira, Daniela Carine Ramires Oliveira, Erivelton Geraldo Nepomuceno   +5 more
doaj   +1 more source

A combinatorial problem on Trapezoidal words

Theoretical Computer Science, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Analysis of the fitness landscape for the class of combinatorial optimisation problems

, 2013
Anatomy of the fitness landscape for a group of well known combinatorial optimisation problems is studied in this research and the similarities and the differences between their landscapes are pointed out.
Tayarani-Najaran, M.-H.
core   +1 more source

Deep Learning Pose Estimation for Phenotyping of Co‐Occurring Hyperkinetic Movement Disorders

Annals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective To explore whether routine outpatient video combined with deep learning‐based pose estimation and clinically interpretable kinematic features can support multi‐label phenotyping of co‐occurring hyperkinetic movement disorders (HMDs).
Laura Cif, Diane Demailly, Gabriella A. Horvàth, Juan Dario Ortigoza Escobar, Nathalie Dorison, Mayté Castro Jiménez, Cécile A. Hubsch, Thomas Wirth, Gun‐Marie Hariz, Sophie Huby, Morgan Dornadic, Zohra Souei, Muhammad Mushhood Ur Rehman, Simone Hemm, Mehdi Boulaymen, Eduardo M. Moraud, Jocelyne Bloch, Xavier Vasques   +17 more
wiley   +1 more source

An Ancient Combinatorial Problem

The American Mathematical Monthly, 2022
Marc Berger, Peter Winkler 0001
openaire   +1 more source

Combinatorial optimization tolerances calculated in linear time [PDF]

For a given optimal solution to a combinatorial optimization problem, we show, under very natural conditions, the equality of the minimal values of upper and lower tolerances, where the upper tolerances are calculated for the given optimal solution and ...
Goldengorin, Boris, Sierksma, Gerard
core  

Motivation for differential evolution for permutative-based combinatorial problems

, 2012
It is generally accepted that Differential Evolution (DE) was originally designed to solve problems which are defined in continuous form. Some researchers have however, felt that this is a limiting factor on DE, hence there have been vigorous research ...
Davendra, Donald David, Onwubolu, Godfrey, Godfrey Onwubolu, Donald Davendra   +3 more
core   +1 more source

Progressive Parkinsonism in PPP2R5D‐Related Neurodevelopmental Disorder

Annals of Clinical and Translational Neurology, EarlyView.
ABSTRACT PPP2R5D‐related neurodevelopmental disorder (Houge–Janssens syndrome type 1) is a rare autosomal dominant condition characterized by macrocephaly, intellectual disability, and epilepsy. Progressive parkinsonism is an emerging adult phenotype that neurologists should be aware of since timely genetic diagnosis opens the door to disease‐modifying
Katerina Bernardi, Enrique Gonzalez Saez‐Diez, Joshua Rong, Beril Ay, Shabbir Merchant, Kathryn Yang, Darius Ebrahimi‐Fakhari   +6 more
wiley   +1 more source

APPLICATIONS OF BRANCH-BOUND ALGORITHM TO SOLVE SOME OPTIMAL PROBLEMS RELATED TO THE HAMILTONIAN CYCLE BASED ON THE TSP

Tạp chí Khoa học Đại học Đà Lạt, 2017
The Traveling Salesman Problem (TSP) is the most prominent of the combinatorial optimization problems that belongs to NP-Hard. The best algorithm for solving TSP is the branch-bound algorithm with exponential-time complexity.
Đỗ Như An
doaj   +1 more source