Výsledky vyhľadávania - approximate (statistics OR statistika) dynamic programming algorithm

  1. 1

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

    ISSN: 1367-4803, 1367-4811, 1460-2059, 1367-4811
    Vydavateľské údaje: England Oxford University Press 15.07.2019
    Vydané v Bioinformatics (15.07.2019)
    “… 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…”
    Získať plný text
    Journal Article
  2. 2

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

    ISSN: 0041-1655, 1526-5447
    Vydavateľské údaje: Baltimore INFORMS 01.05.2009
    Vydané v Transportation science (01.05.2009)
    “… The goal of the model was not to obtain a better solution but rather to closely match a number of operational statistics…”
    Získať plný text
    Journal Article
  3. 3

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

    ISSN: 0162-1459, 1537-274X
    Vydavateľské údaje: Alexandria Taylor & Francis 02.01.2020
    “…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…”
    Získať plný text
    Journal Article
  4. 4

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

    ISSN: 0898-2112, 1532-4222
    Vydavateľské údaje: Taylor & Francis 03.07.2025
    Vydané v Quality engineering (03.07.2025)
    “…Bayesian preference elicitation is a statistical framework which can aid in complex decision making processes such as engineering design by offering…”
    Získať plný text
    Journal Article
  5. 5

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

    ISSN: 0162-1459, 1537-274X, 1537-274X
    Vydavateľské údaje: Alexandria Taylor & Francis 02.10.2023
    “…) 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…”
    Získať plný text
    Journal Article
  6. 6

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

    ISSN: 0269-9648, 1469-8951
    Vydavateľské údaje: New York, USA Cambridge University Press 01.07.2020
    “…We study an online capacity planning problem in which arriving patients require a series of appointments at several departments, within a certain access time…”
    Získať plný text
    Journal Article
  7. 7

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

    ISSN: 0377-2217, 1872-6860
    Vydavateľské údaje: Amsterdam Elsevier B.V 16.10.2012
    “… ► Design efficient approximate dynamic programming (ADP) solution algorithms. ► Compare ADP policies with the Markov decision processes (MDP) benchmark…”
    Získať plný text
    Journal Article
  8. 8

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

    ISSN: 0162-1459, 1537-274X, 1537-274X
    Vydavateľské údaje: United States Taylor & Francis 03.07.2018
    “… 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…”
    Získať plný text
    Journal Article
  9. 9

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

    ISSN: 0025-5610, 1436-4646
    Vydavateľské údaje: Berlin/Heidelberg Springer Berlin Heidelberg 01.05.2020
    Vydané v Mathematical programming (01.05.2020)
    “…Mixed integer dynamic approximation scheme (MIDAS) is a new sampling-based algorithm for solving finite-horizon stochastic dynamic programs with monotonic Bellman functions…”
    Získať plný text
    Journal Article
  10. 10

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

    ISSN: 0926-6003, 1573-2894
    Vydavateľské údaje: New York Springer US 01.07.2018
    “…We propose a method for finding approximate solutions to multiple-choice knapsack problems…”
    Získať plný text
    Journal Article
  11. 11

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

    ISSN: 0925-5001, 1573-2916
    Vydavateľské údaje: New York Springer US 01.06.2016
    Vydané v Journal of global optimization (01.06.2016)
    “… 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…”
    Získať plný text
    Journal Article
  12. 12

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

    ISSN: 0941-0643, 1433-3058
    Vydavateľské údaje: London Springer London 01.09.2018
    Vydané v Neural computing & applications (01.09.2018)
    “… 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…”
    Získať plný text
    Journal Article
  13. 13

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

    ISSN: 0941-0643, 1433-3058
    Vydavateľské údaje: London Springer London 01.05.2014
    Vydané v Neural computing & applications (01.05.2014)
    “…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…”
    Získať plný text
    Journal Article
  14. 14

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

    ISSN: 0957-4174, 1873-6793
    Vydavateľské údaje: New York Elsevier Ltd 15.06.2017
    Vydané v Expert systems with applications (15.06.2017)
    “…•A case study addresses multicollinearity between ozone pollution concentrations. Dynamic programming (DP…”
    Získať plný text
    Journal Article
  15. 15

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

    ISSN: 1009-6124, 1559-7067
    Vydavateľské údaje: Berlin/Heidelberg Springer Berlin Heidelberg 01.02.2025
    “…This paper considers the value iteration algorithms of stochastic zero-sum linear quadratic games with unkown dynamics…”
    Získať plný text
    Journal Article
  16. 16

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

    ISSN: 1598-5865, 1865-2085
    Vydavateľské údaje: Berlin/Heidelberg Springer Berlin Heidelberg 01.06.2023
    “…This paper develops a novel adaptive dynamic programming (ADP)-based model-free policy iteration (PI…”
    Získať plný text
    Journal Article
  17. 17

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

    ISSN: 0025-1909, 1526-5501
    Vydavateľské údaje: Hanover, MD INFORMS 01.12.2012
    Vydané v Management science (01.12.2012)
    “…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…”
    Získať plný text
    Journal Article
  18. 18

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

    ISSN: 0735-0015, 1537-2707
    Vydavateľské údaje: Alexandria Taylor & Francis 03.07.2023
    “…This article studies multiple structural breaks in large contemporaneous covariance matrices of high-dimensional time series satisfying an approximate factor model…”
    Získať plný text
    Journal Article
  19. 19

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

    ISSN: 1367-4803, 1367-4811, 1367-4811
    Vydavateľské údaje: Oxford Oxford University Press 01.06.2012
    Vydané v Bioinformatics (Oxford, England) (01.06.2012)
    “… Since the data available for calibration will have limited precision, an approximate representation of the ODEs dynamics should suffice…”
    Získať plný text
    Journal Article
  20. 20

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

    ISSN: 1557-8666, 1557-8666
    Vydavateľské údaje: United States 01.10.2024
    Vydané v Journal of computational biology (01.10.2024)
    “…This study introduces a pioneering approach to automate the creation of search schemes for lossless approximate pattern matching…”
    Zistit podrobnosti o prístupe
    Journal Article