Suchergebnisse - approximate statistics (dynamic OR dynamik) programming algorithm~

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

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

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 …”
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

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

Approximate dynamic programming algorithms for optimal dosage decisions in controlled ovarian hyperstimulation von He, Miao, Zhao, Lei, Powell, Warren B.

“… ► Design efficient approximate dynamic programming (ADP) solution algorithms. ► Compare ADP policies with the Markov decision processes (MDP) benchmark …”
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

MIDAS: A mixed integer dynamic approximation scheme von Philpott, A. B., Wahid, F., Bonnans, J. F.

“… Mixed integer dynamic approximation scheme (MIDAS) is a new sampling-based algorithm for solving finite-horizon stochastic dynamic programs with monotonic Bellman functions …”
Volltext

A multi-criteria approach to approximate solution of multiple-choice knapsack problem von Bednarczuk, Ewa M., Miroforidis, Janusz, Pyzel, Przemysław

“… We propose a method for finding approximate solutions to multiple-choice knapsack problems …”
Volltext

Dynamic programming approximation algorithms for the capacitated lot-sizing problem von Büyüktahtakın, İ. Esra, Liu, Ning

“… The proposed method combines dynamic programming with regression, data fitting, and approximation techniques to estimate the inventory cost function at each stage of the dynamic program …”
Volltext

Optimized radial basis function neural network for improving approximate dynamic programming in pricing high dimensional options von Hajizadeh, Ehsan, Mahootchi, Masoud

“… In this paper, we develop an optimized radial basis function neural network (RBFNN), which is optimally tuned by the particle swarm optimization algorithm to enhance the efficiency and accuracy of approximate dynamic programming (ADP …”
Volltext

Stable iterative adaptive dynamic programming algorithm with approximation errors for discrete-time nonlinear systems von Wei, Qinglai, Liu, Derong

“… In this paper, a novel iterative adaptive dynamic programming (ADP) algorithm is developed to solve infinite horizon optimal control problems for discrete-time nonlinear systems …”
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

On-Policy and Off-Policy Value Iteration Algorithms for Stochastic Zero-Sum Dynamic Games von Guo, Liangyuan, Wang, Bing-Chang, Zhang, Ji-Feng

“… This paper considers the value iteration algorithms of stochastic zero-sum linear quadratic games with unkown dynamics …”
Volltext

An adaptive dynamic programming-based algorithm for infinite-horizon linear quadratic stochastic optimal control problems von Zhang, Heng

“… This paper develops a novel adaptive dynamic programming (ADP)-based model-free policy iteration (PI …”
Volltext

Pathwise Optimization for Optimal Stopping Problems von Desai, Vijay V., Farias, Vivek F., Moallemi, Ciamac C.

“… We introduce the pathwise optimization (PO) method, a new convex optimization procedure to produce upper and lower bounds on the optimal value (the "price") of …”
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

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

Lossless Approximate Pattern Matching: Automated Design of Efficient Search Schemes von Renders, Luca, Depuydt, Lore, Rahmann, Sven, Fostier, Jan

“… This study introduces a pioneering approach to automate the creation of search schemes for lossless approximate pattern matching …”
Weitere Angaben