Results 51 to 60 of about 1,967,671 (302)
An Ising Machine Approach to the Personalized Course Selection Problem
A combinatorial optimization problem is a problem finding an optimal combination of variables that maximizes or minimizes an objective function while satisfying given constraints.
Takeru Ota +2 more
doaj +1 more source
Universally Balanced Combinatorial Optimization Games
This article surveys studies on universally balanced properties of cooperative games defined in a succinct form. In particular, we focus on combinatorial optimization games in which the values to coalitions are defined through linear optimization ...
Xiaotie Deng, Gabrielle Demange
doaj +1 more source
Bird Mating Optimizer for Combinatorial Optimization Problems
The bird mating optimizer is a new metaheuristic algorithm that was originally proposed to solve continuous optimization problems with a very promising performance.
Anas Arram +3 more
doaj +1 more source
Ewing Sarcoma in Infants and Children Under 2 Years of Age: A French Retrospective Study
ABSTRACT Ewing sarcoma, the second most common primary bone cancer in children, requires intensive treatment that may lead to significant long‐term sequelae, particularly in infants. We retrospectively analyzed data from 1621 French patients treated between 1988 and 2015 within the EW88/93/97 or EE99 trials, focusing on 17 infants diagnosed before 24 ...
Elodie Verdier +18 more
wiley +1 more source
ABSTRACT Background Pediatric thromboembolism is increasingly encountered in critical care. Systemic thrombolysis with tissue plasminogen activator (tPA) facilitates vessel or valve patency, yet pediatric‐specific protocols remain undefined, and safety concerns persist. Objective To evaluate the efficacy and safety of a tailored, prolonged systemic tPA
Eran Shostak +5 more
wiley +1 more source
ABSTRACT We assessed the effect of iron overload (IO) on mortality and complications following hematopoietic stem cell transplantation (HSCT) in patients with Diamond–Blackfan anemia syndrome (DBAS) in a systematic review of individual participant data and cohort data from observational studies.
Geoffrey Z. L. Kuppens +6 more
wiley +1 more source
Stochastic Simulated Quantum Annealing for Fast Solution of Combinatorial Optimization Problems
Combinatorial optimization problems are frequently classified as NP-hard, which means that the time needed to find the optimal solution generally increases exponentially with the problem size.
Naoya Onizawa +4 more
doaj +1 more source
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
ABSTRACT Background Therapeutic apheresis (TA) is an established treatment modality for hematologic, neurologic, and immunologic disorders, yet access remains severely limited in sub‐Saharan Africa. Donor apheresis, including platelet apheresis collection from healthy donors, represents an important complementary modality supporting blood product ...
Nosa Bazuaye +33 more
wiley +1 more source
MATHEMATICAL MODEL FOR OPTIMIZATION PROBLEM OF ONE MULTIPROCESSING COMPUTER SYSTEM AND ITS SOLUTION
The mathematical model of task of the work optimization of multiprocessing computer system as Euclidian combinatorial optimization problem on vertex-located set is formed.
O.A. Yemets +2 more
doaj +1 more source

