Results 111 to 120 of about 2,517,848 (305)
Approximation Algorithms Inspired by Kernelization Methods
in Lecture Notes in Computer Science, vol. 8889Kernelization algorithms in the context of Parameterized Complexity are often based on a combination of reduction rules and combinatorial insights.
Abu-Khzam, Faisal +3 more
core +2 more sources
Cancer treatment is associated with measurable acceleration of biological aging across epigenetic, telomere, senescence, and immune biomarkers. However, biomarker validation and interventional strategies remain limited, especially in hematologic malignancies, underscoring the need for standardized multi‐omic aging assessments and adequately powered ...
Moataz Ellithi +3 more
wiley +1 more source
ABSTRACT Objective We aim to comprehensively analyze how regional tumor and edema characteristics are associated with clinical presentations and survival outcomes in a large cohort of glioblastoma patients. Methods Patients with IDH‐wildtype glioblastoma who received brain MRI from 2010 to 2023 were included.
Daniel J. Zhou +16 more
wiley +1 more source
Approximation in stochastic integer programming [PDF]
Approximation algorithms are the prevalent solution methods in the field of stochastic programming. Problems in this field are very hard to solve. Indeed, most of the research in this field has concentrated on designing solution methods that approximate ...
Vlerk, Maarten H. van der, Stougie, Leen
core
ABSTRACT Objective To clarify the clinical relevance of dopamine transporter single‐photon emission computed tomography (DAT‐SPECT) abnormalities in amyotrophic lateral sclerosis (ALS), with a prespecified focus on sex‐stratified associations with disease progression and short‐term prognosis.
Tomoya Kawazoe +7 more
wiley +1 more source
Comparing policy gradient and value function based reinforcement learning methods in simulated electrical power trade [PDF]
In electrical power engineering, reinforcement learning algorithms can be used to model the strategies of electricity market participants. However, traditional value function based reinforcement learning algorithms suffer from convergence issues when ...
Burt, Graeme +7 more
core +1 more source
Uncovering G Protein‐Coupled Receptors: Novel Targets and Biomarkers for Predicting Glioma Prognosis
ABSTRACT Background Low‐grade gliomas (LGG) exhibit significant heterogeneity and recurrence risk. G protein‐coupled receptors (GPCR) contribute to glioma malignant progression, but their prognostic value remains unclear. This work attempts to formulate a GPCR‐based outcome‐predicting model for LGG. Methods Based on TCGA LGG data, the enrichment scores
Jun Yang +4 more
wiley +1 more source
Structured low-rank approximation and its applications
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equivalent to the existence of a linear time-invariant system that fits the data ...
Markovsky, Ivan
core +1 more source
Since the publication of the first scheduling paper in 1954, a huge number of works dealing with different types of single machine problems have appeared.
Nodari Vakhania +2 more
doaj +1 more source
On Pseudodeterministic Approximation Algorithms.
We investigate the notion of pseudodeterminstic approximation algorithms. A randomized approximation algorithm A for a function f is pseudodeterministic if for every input x there is a unique value v so that A(x) outputs v with high probability, and v is a good approximation of f(x).
Peter Dixon 0002 +2 more
openaire +3 more sources

