Suchergebnisse - approximate (statistical OR statistics) (dynamic OR dynamika) programming algorithm

A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments von Harman, Radoslav, Filová, Lenka, Richtárik, Peter

“… We propose a class of subspace ascent methods for computing optimal approximate designs that covers existing algorithms as well as new and more efficient ones …”
Volltext

Approximate dynamic programming methods in Bayesian preference elicitation von Fisher, William, Zhang, Qiong, Song, Yongjia

“… Bayesian preference elicitation is a statistical framework which can aid in complex decision making processes such as engineering design by offering preference-informed recommendations to a decision maker (DM …”
Volltext

LinearFold: linear-time approximate RNA folding by 5'-to-3' dynamic programming and beam search von Huang, Liang, Zhang, He, Deng, Dezhong, Zhao, Kai, Liu, Kaibo, Hendrix, David A, Mathews, David H

“… Existing algorithms [based on dynamic programming] suffer from a major limitation: their runtimes scale cubically with the RNA length, and this slowness limits their use in genome-wide applications …”
Volltext

A Bayesian Machine Learning Approach for Optimizing Dynamic Treatment Regimes von Murray, Thomas A., Yuan, Ying, Thall, Peter F.

“… These decisions can be formalized as a dynamic treatment regime. This article describes a new approach for optimizing dynamic treatment regimes, which bridges the gap between Bayesian inference and existing approaches, like Q-learning …”
Volltext

An Approximate Dynamic Programming Algorithm for Large-Scale Fleet Management: A Case Application von Simao, Hugo P, Day, Jeff, George, Abraham P, Gifford, Ted, Nienow, John, Powell, Warren B

“… The goal of the model was not to obtain a better solution but rather to closely match a number of operational statistics …”
Volltext

Metropolis-Hastings via Classification von Kaji, Tetsuya, Ročková, Veronika

“… ) estimators which can be plugged into the Metropolis-Hastings algorithm. The resulting Markov chains generate, at a steady state, samples from an approximate posterior whose asymptotic properties we characterize …”
Volltext

Detection of Multiple Structural Breaks in Large Covariance Matrices von Li, Yu-Ning, Li, Degui, Fryzlewicz, Piotr

“… This article studies multiple structural breaks in large contemporaneous covariance matrices of high-dimensional time series satisfying an approximate factor model …”
Volltext

Online Smooth Backfitting for Generalized Additive Models von Yang, Ying, Yao, Fang, Zhao, Peng

“… by the dynamic candidate bandwidth method. We investigate the statistical and algorithmic convergences of the proposed method …”
Volltext

Selecting the Correct Number of Factors in Approximate Factor Models: The Large Panel Case With Group Bridge Estimators von Caner, Mehmet, Han, Xu

“… This article proposes a group bridge estimator to select the correct number of factors in approximate factor models …”
Volltext

Approximate probabilistic analysis of biopathway dynamics von Liu, Bing, Hagiescu, Andrei, Palaniappan, Sucheendra K., Chattopadhyay, Bipasa, Cui, Zheng, Wong, Weng-Fai, Thiagarajan, P. S.

“… Since the data available for calibration will have limited precision, an approximate representation of the ODEs dynamics should suffice …”
Volltext

New efficient algorithms for multiple change-point detection with reproducing kernels von Celisse, A., Marot, G., Pierre-Jean, M., Rigaill, G.J.

“… Several statistical approaches based on reproducing kernels have been proposed to detect abrupt changes arising in the full distribution of the observations and not only in the mean or variance …”
Volltext

Bayesian Neural Networks for Selection of Drug Sensitive Genes von Liang, Faming, Li, Qizhai, Zhou, Lei

“… Recent advances in high-throughput biotechnologies have provided an unprecedented opportunity for biomarker discovery, which, from a statistical point of view, can be cast as a variable selection problem …”
Volltext

Integrated neuro-evolution-based computing solver for dynamics of nonlinear corneal shape model numerically von Ahmad, Iftikhar, Raja, Muhammad Asif Zahoor, Ramos, Higinio, Bilal, Muhammad, Shoaib, Muhammad

“… ), genetic algorithms (GAs), simulated annealing (SA), active-set technique (AST), interior-point technique, sequential quadratic programming and their hybrid forms based on GA–AST, PS–AST and SA–AST …”
Volltext

A dynamic programming algorithm for identification of triplex-forming sequences von Lexa, Matej, Martínek, Tomáš, Burgetová, Ivana, Kopeček, Daniel, Brázdová, Marie

“… : We modified an algorithm for detection of approximate palindromes, so as to account for the special nature of triplex DNA structures …”
Volltext

Data mining for state space orthogonalization in adaptive dynamic programming von Ariyajunya, Bancha, Chen, Ying, Chen, Victoria C.P., Kim, Seoung Bum

“… •A case study addresses multicollinearity between ozone pollution concentrations. Dynamic programming (DP …”
Volltext

A Probabilistic Model of Local Sequence Alignment That Simplifies Statistical Significance Estimation von Eddy, Sean R.

“… Sequence database searches require accurate estimation of the statistical significance of scores …”
Volltext

Bayesian Bootstrap Spike-and-Slab LASSO von Nie, Lizhen, Ročková, Veronika

“… Intrigued by the speed of Spike-and-Slab LASSO mode detection, we explore the possibility of sampling from an approximate …”
Volltext

Bayesian Regularization for Graphical Models With Unequal Shrinkage von Gan, Lingrui, Narisetty, Naveen N., Liang, Feng

“… For fast and efficient computation, an EM algorithm is proposed to compute the MAP estimator of the precision matrix and (approximate …”
Volltext

New integer optimization models and an approximate dynamic programming algorithm for the lot-sizing and scheduling problem with sequence-dependent setups von Lee, Younsoo, Lee, Kyungsik

“… •An ADP algorithm based on the time-flow model is also proposed.•The proposed algorithm shows computational benefits over the standard MIP solver …”
Volltext

ONLINE CAPACITY PLANNING FOR REHABILITATION TREATMENTS: AN APPROXIMATE DYNAMIC PROGRAMMING APPROACH von Bikker, Ingeborg A., Mes, Martijn R.K., Sauré, Antoine, Boucherie, Richard J.

“… We study an online capacity planning problem in which arriving patients require a series of appointments at several departments, within a certain access time …”
Volltext