Results 151 to 160 of about 129,306 (313)
Building integrated ontological knowledge structures with efficient approximation algorithms. [PDF]
Biomed Res Int, 2015 Xiang Y, Janga SC.
europepmc +1 more source
Approximation algorithms for combinatorial problems
Proceedings of the fifth annual ACM symposium on Theory of computing - STOC '73, 1973 Simple, polynomial-time, heuristic algorithms for finding approximate solutions to various polynomial complete optimization problems are analyzed with respect to their worst case behavior, measured by the ratio of the worst solution value that can be chosen by the algorithm to the optimal value.
openaire +1 more source
Annals of Clinical and Translational Neurology, EarlyView.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
Convergence by Class of Kantorovich-Type q-Szász Operators and Comprehensive Results
MathematicsIn this paper, we primarily use Stancu variants of Kantorovich-type operators to investigate the convergence and other associated properties of new Szász–Mirakjan operators.
Md. Nasiruzzaman +2 more
doaj +1 more source
Dentate Gyrus circuitry features improve performance of sparse approximation algorithms. [PDF]
PLoS One, 2015 Petrantonakis PC, Poirazi P.
europepmc +1 more source
On Estimation Algorithms vs Approximation Algorithms.
, 2008 In a combinatorial optimization problem, when given an input instance, one seeks a feasible solution that optimizes the value of the objective function. Many combinatorial optimization problems are NP-hard. A way of coping with NP-hardness is by considering approximation algorithms.
openaire +3 more sources
Uncovering G Protein‐Coupled Receptors: Novel Targets and Biomarkers for Predicting Glioma Prognosis
Annals of Clinical and Translational Neurology, EarlyView.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
Mean-field approximation of stochastic population processes in games [PDF]
We here establish an upper bound on the probability for deviations of a Markov population process from its mean-field approximation.
Jörgen Weibull, Michel Benaïm
core
MathematicsThe celebrated question of whether P=NP continues to define the boundary between the feasible and the intractable in computer science. In this paper, we revisit the problem from two complementary angles: Time-Relative Description Complexity and automated
John Abela +2 more
doaj +1 more source
A Two‐Stage Questionnaire and Actigraphy Screening for iRBD in a Multicenter Retrospective Cohort
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective Isolated rapid‐eye‐movement sleep behavior disorder is a prodromal marker of synucleinopathies. However, most cases remain undiagnosed due to the insufficient predictive value of questionnaires and limited access to confirmatory video‐polysomnography. We assessed a two‐stage screening strategy combining a brief questionnaire on rapid‐
Caleb A. Massimi +17 more
wiley +1 more source