Results 81 to 90 of about 167,714 (331)
An efficient algorithm for learning with semi-bandit feedback
We consider the problem of online combinatorial optimization under semi-bandit feedback. The goal of the learner is to sequentially select its actions from a combinatorial decision set so as to minimize its cumulative loss.
A. György +11 more
core +1 more source
Optimizing Solution-Samplers for Combinatorial Problems: The Landscape of Policy-Gradient Methods [PDF]
Constantine Caramanis +4 more
openalex +1 more source
ABSTRACT As global populations age, cancer is increasingly becoming a leading cause of morbidity and mortality among older adults, particularly in low‐ and middle‐income countries (LMICs). Despite accounting for the majority of new cancer cases and deaths, older individuals remain underrepresented in cancer research, clinical guidelines, and health ...
Ibrahim Bidemi Abdullateef +2 more
wiley +1 more source
Focusing on the Golden Ball Metaheuristic: An Extended Study on a Wider Set of Problems
Nowadays, the development of new metaheuristics for solving optimization problems is a topic of interest in the scientific community. In the literature, a large number of techniques of this kind can be found.
E. Osaba +4 more
doaj +1 more source
Approximating Incremental Combinatorial Optimization Problems.
We consider incremental combinatorial optimization problems, in which a solution is constructed incrementally over time, and the goal is to optimize not the value of the final solution but the average value over all timesteps. We consider a natural algorithm of moving towards a global optimum solution as quickly as possible. We show that this algorithm
Goemans, Michel X, Unda, Francisco Tomas
openaire +5 more sources
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
Aplicación de la búsqueda tabú en regresión no lineal
We implement the combinatorial optimization technique known as tabu search in the parameter estimation problem in a given non linear model. For the generation of neighbors, the implementation is based on a discretization of the parameter space, which is ...
Mario A. Villalobos +2 more
doaj +1 more source
Persistency in combinatorial optimization problems on matroids
Algorithms on matroids to find maximum weight bases or to solve the cardinality intersection problem of two matroids are analyzed to obtain a persistency partition of the elements into 1-persistent elements, which belong to all optimal solutions, 0-persistent ones which do not belong to any optimal solution, and non-persistent elements which belong to ...
Katarína Cechlárová, Vladimír Lacko
openaire +2 more sources
Merging Combinatorial Design and Optimization: the Oberwolfach Problem [PDF]
The Oberwolfach Problem $OP(F)$ -- posed by Gerhard Ringel in 1967 -- is a paradigmatic Combinatorial Design problem asking whether the complete graph $K_v$ decomposes into edge-disjoint copies of a $2$-regular graph $F$ of order $v$. In this paper, we provide all the necessary equipment to generate solutions to $OP(F)$ for relatively small orders by ...
Fabio Salassa +4 more
openaire +6 more sources
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

