Results 41 to 50 of about 321 (213)

On Hierarchical Composite Endpoints in Pediatric Cancer Supportive Care: Illustrative Examples From Two Multi‐Center Phase‐III Randomized Clinical Trials

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Pediatric supportive care clinical trials often involve multiple clinically important outcomes, complicating trial interpretation. Hierarchical composite endpoints (HCEs) provide a framework to integrate key outcomes according to clinical importance.
Willem H. Collier   +11 more
wiley   +1 more source

Modelling stem cell differentiation related processes—A practical overview for biologists

open access: yesFEBS Letters, EarlyView.
Stem cell differentiation is complex and difficult to control experimentally. This review introduces suitable computational modelling approaches that can support stem cell research, from mechanistic ODE and abstract models to multiscale and deep learning methods.
Ricco Zeegelaar   +4 more
wiley   +1 more source

Heuristics for the One-Dimensional Bin Packing Problem with Time Windows

open access: yesFrontiers in Applied Mathematics and Statistics
This paper investigates the one-dimensional bin packing problem with time windows (1DBPP-TW), a practical variant of the bin packing problem widely applied in logistics.
Huibing Cheng   +4 more
doaj   +1 more source

Algorithms for the bin packing problem with scenarios

open access: yesJournal of Combinatorial Optimization
This paper presents theoretical and practical results for the bin packing problem with scenarios, a generalization of the classical bin packing problem which considers the presence of uncertain scenarios, of which only one is realized. For this problem, we propose an absolute approximation algorithm whose ratio is bounded by the square root of the ...
Yulle G. F. Borges   +5 more
openaire   +3 more sources

Design and analysis strategies for robust microbiome ageing research

open access: yesFEBS Letters, EarlyView.
The gut microbiome changes with age and associates with age‐related morbidity and mortality, establishing it as a potential biomarker and intervention target for ageing. Realising this potential requires methodological rigour, yet distinguishing biological signals from methodological artefacts remains challenging across cohorts. This review provides an
Mark Olenik   +5 more
wiley   +1 more source

Dynamic 3-D Bin Packing Collaborative Optimization Method Based on Hierarchical Reinforcement Learning Driven by Digital Twins

open access: yesIEEE Access
Modern logistics systems are confronted with the challenge of the collaborative optimization of container loading efficiency and stability under dynamic environments and multi-dimensional constraints.
Jiquan Zhang   +4 more
doaj   +1 more source

Finding novel vulnerabilities of hypomorphic BRCA1 alleles

open access: yesMolecular Oncology, EarlyView.
Synthetic lethality screens performed to identify novel vulnerabilities often model complete gene loss, thereby overlooking patient‐derived hypomorphic mutations. In this study, we have performed genome‐wide CRISPR screens on BRCA1 hypomorphic mutations, showing BRCA1I26A behaves like wild‐type, while BRCA1R1699Q mimics deficiency. Furthermore, we have
Anne Schreuder   +10 more
wiley   +1 more source

An experimental comparison of some heuristics for cardinality constrained bin packing problem

open access: yesBusiness Systems Research, 2012
Background: Bin packing is an NPhard optimization problem of packing items of given sizes into minimum number of capacitylimited bins. Besides the basic problem, numerous other variants of bin packing exist.
Maja Remic   +2 more
doaj  

QAL-BP: an augmented Lagrangian quantum approach for bin packing

open access: yesScientific Reports
The bin packing is a well-known NP-Hard problem in the domain of artificial intelligence, posing significant challenges in finding efficient solutions. Conversely, recent advancements in quantum technologies have shown promising potential for achieving ...
Lorenzo Cellini   +2 more
doaj   +1 more source

Meta-Heuristic Algorithms for the Generalized Extensible Bin Packing Problem With Overload Cost

open access: yesIEEE Access, 2022
In this paper, we consider a generalized extensible bin packing problem with overload cost, first proposed by Denton et al. in 2010, in which the total size of items packed into a bin is allowed to exceed its capacity, and the cost incurred each bin is ...
Ran Ding, Bin Deng, Weidong Li
doaj   +1 more source

Home - About - Disclaimer - Privacy