Results 101 to 110 of about 2,824,860 (307)
Randomized competitive algorithms for successful and unsuccessful search
, 1996 This paper studies the classical dictionary problem using a self-adjusting linear list. We designed and analyzed randomized, on-line algorithms for a sequence of successful and unsuccessful searches which are competitive with off-line algorithms.
Hui, LCK, Martel, CU
core +1 more source
Randomized and quantum algorithms for solving initial-value problems in ordinary differential equations of order k [PDF]
Opuscula Mathematica, 2008 The complexity of initial-value problems is well studied for systems of equations of first order. In this paper, we study the \(\varepsilon\)-complexity for initial-value problems for scalar equations of higher order.
Maciej Goćwin, Marek Szczęsny
doaj
FEBS Open Bio, EarlyView.In this study, a novel esterase from the thermoacidophilic archaeon Thermoplasma acidophilum was biochemically and structurally characterized. Our results demonstrate that Ta0887 is a highly thermostable esterase that preferentially hydrolyzes p‐nitrophenyl hexanoate and possesses an α‐helical cap domain that likely contributes to its substrate ...
Alejandro Delgado‐Rey +4 more
wiley +1 more source
Randomized Algorithms for Geometric Optimization Problems
, 2000 This chapter reviews randomization algorithms developed in the last few years to solve a wide range of geometric optimization problems. We review a number of general techniques, including randomized binary search, randomized linear-programming algorithms,
Sandeep Sen, Pankaj K. Agarwal
core +1 more source
BMC Health Services Research, 2002 Introduction Trials of complex health interventions often pose difficult methodologic challenges. The objective of this paper is to assess the extent to which the various development steps of a cluster randomized trial to optimize antibiotic use in ...
Loeb Mark B
doaj +1 more source
Aging and Cancer, EarlyView.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
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Introduction Glucagon‐like peptide‐1 receptor agonists (GLP‐1 RAs) have demonstrated significant weight‐reducing effects and may offer benefits in idiopathic intracranial hypertension (IIH); however, recent concerns about the risk of non‐arteritic anterior ischemic optic neuropathy (NAION) have emerged.
Faisal A. Al‐Harbi +9 more
wiley +1 more source
Regularized randomized iterative algorithms for factorized linear systems [PDF]
, 2023 Randomized iterative algorithms for solving a factorized linear system, $\mathbf A\mathbf B\mathbf x=\mathbf b$ with $\mathbf A\in{\mathbb{R}}^{m\times \ell}$, $\mathbf B\in{\mathbb{R}}^{\ell\times n}$, and $\mathbf b\in{\mathbb{R}}^m$, have recently ...
Du, Kui
core
A Framework for Statistical Inference via Randomized Algorithms [PDF]
, 2023 Randomized algorithms, such as randomized sketching or projections, are a promising approach to ease the computational burden in analyzing large datasets.
Zhang, Zhixiang +2 more
core +1 more source
The open-closed mod-minimizer algorithm
Algorithms for Molecular BiologySampling algorithms that deterministically select a subset of $$k$$ k -mers are an important building block in bioinformatics applications. For example, they are used to index large textual collections, like DNA, and to compare sequences quickly. In such
Ragnar Groot Koerkamp +2 more
doaj +1 more source