Suchergebnisse - approximate statistics (((dynamic OR dynamik) OR dynamik) OR dynamik) 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

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

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

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

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

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

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

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

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

“… It is based on an exact optimization algorithm and deals …”
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

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

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

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

Multiplicative auction algorithm for approximate maximum weight bipartite matching von Zheng, Da Wei, Henzinger, Monika

“… ) . Our algorithm is very simple and it can be extended to give a dynamic data structure that maintains a ( 1 - ε …”
Volltext

Integrated computational intelligent paradigm for nonlinear electric circuit models using neural networks, genetic algorithms and sequential quadratic programming von Mehmood, Ammara, Zameer, Aneela, Ling, Sai Ho, Rehman, Ata ur, Raja, Muhammad Asif Zahoor

“… ), global search efficacy of genetic algorithms (GA) and rapid local search with sequential quadratic programming (SQP …”
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

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

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

The ordered k-median problem: surrogate models and approximation algorithms von Aouad, Ali, Segev, Danny

“… ) in the ordered list of all coverage distances. While antecedent literature has focused on mathematical properties of ordered median functions, integer programming methods, various heuristics, and special …”
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