Výsledky vyhledávání - approximate statistics dynamic programming algorithm
-
1
LinearFold: linear-time approximate RNA folding by 5'-to-3' dynamic programming and beam search
ISSN: 1367-4803, 1367-4811, 1460-2059, 1367-4811Vydáno: England Oxford University Press 15.07.2019Vydáno 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ískat plný text
Journal Article -
2
An Approximate Dynamic Programming Algorithm for Large-Scale Fleet Management: A Case Application
ISSN: 0041-1655, 1526-5447Vydáno: Baltimore INFORMS 01.05.2009Vydáno 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ískat plný text
Journal Article -
3
A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments
ISSN: 0162-1459, 1537-274XVydáno: Alexandria Taylor & Francis 02.01.2020Vydáno v Journal of the American Statistical Association (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ískat plný text
Journal Article -
4
Energy-Efficient Link Selection and Transmission Scheduling in Mobile Cloud Computing
ISSN: 2162-2337, 2162-2345Vydáno: Piscataway IEEE 01.04.2014Vydáno v IEEE wireless communications letters (01.04.2014)“… To solve the formulated SDP, we then propose a scalable approximate dynamic programming (ADP) algorithm that does not require the statistics of exogenous stochastic information…”
Získat plný text
Journal Article -
5
Approximate dynamic programming methods in Bayesian preference elicitation
ISSN: 0898-2112, 1532-4222Vydáno: Taylor & Francis 03.07.2025Vydáno 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ískat plný text
Journal Article -
6
Reinforcement learning-based design of sampling policies under cost constraints in Markov random fields: Application to weed map reconstruction
ISSN: 0167-9473, 1872-7352Vydáno: Elsevier B.V 01.04.2014Vydáno v Computational statistics & data analysis (01.04.2014)“…Weeds are responsible for yield losses in arable fields, whereas the role of weeds in agro-ecosystem food webs and in providing ecological services has been…”
Získat plný text
Journal Article -
7
Modeling and Analysis of Baseline Manipulation in Demand Response Programs
ISSN: 1949-3053, 1949-3061Vydáno: Piscataway IEEE 01.03.2022Vydáno v IEEE transactions on smart grid (01.03.2022)“… We investigate the approximation of baseline methods to understand how the method parameters and the consumption statistics would affect the strategic behavior…”
Získat plný text
Journal Article -
8
Metropolis-Hastings via Classification
ISSN: 0162-1459, 1537-274X, 1537-274XVydáno: Alexandria Taylor & Francis 02.10.2023Vydáno v Journal of the American Statistical Association (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ískat plný text
Journal Article -
9
ONLINE CAPACITY PLANNING FOR REHABILITATION TREATMENTS: AN APPROXIMATE DYNAMIC PROGRAMMING APPROACH
ISSN: 0269-9648, 1469-8951Vydáno: New York, USA Cambridge University Press 01.07.2020Vydáno v Probability in the engineering and informational sciences (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ískat plný text
Journal Article -
10
Approximate dynamic programming algorithms for optimal dosage decisions in controlled ovarian hyperstimulation
ISSN: 0377-2217, 1872-6860Vydáno: Amsterdam Elsevier B.V 16.10.2012Vydáno v European journal of operational research (16.10.2012)“… ► Design efficient approximate dynamic programming (ADP) solution algorithms. ► Compare ADP policies with the Markov decision processes (MDP) benchmark…”
Získat plný text
Journal Article -
11
A Bayesian Machine Learning Approach for Optimizing Dynamic Treatment Regimes
ISSN: 0162-1459, 1537-274X, 1537-274XVydáno: United States Taylor & Francis 03.07.2018Vydáno v Journal of the American Statistical Association (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ískat plný text
Journal Article -
12
MIDAS: A mixed integer dynamic approximation scheme
ISSN: 0025-5610, 1436-4646Vydáno: Berlin/Heidelberg Springer Berlin Heidelberg 01.05.2020Vydáno 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ískat plný text
Journal Article -
13
A multi-criteria approach to approximate solution of multiple-choice knapsack problem
ISSN: 0926-6003, 1573-2894Vydáno: New York Springer US 01.07.2018Vydáno v Computational optimization and applications (01.07.2018)“…We propose a method for finding approximate solutions to multiple-choice knapsack problems…”
Získat plný text
Journal Article -
14
Dynamic programming approximation algorithms for the capacitated lot-sizing problem
ISSN: 0925-5001, 1573-2916Vydáno: New York Springer US 01.06.2016Vydáno 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ískat plný text
Journal Article -
15
Optimized radial basis function neural network for improving approximate dynamic programming in pricing high dimensional options
ISSN: 0941-0643, 1433-3058Vydáno: London Springer London 01.09.2018Vydáno 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ískat plný text
Journal Article -
16
Stable iterative adaptive dynamic programming algorithm with approximation errors for discrete-time nonlinear systems
ISSN: 0941-0643, 1433-3058Vydáno: London Springer London 01.05.2014Vydáno 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ískat plný text
Journal Article -
17
Data mining for state space orthogonalization in adaptive dynamic programming
ISSN: 0957-4174, 1873-6793Vydáno: New York Elsevier Ltd 15.06.2017Vydáno v Expert systems with applications (15.06.2017)“…•A case study addresses multicollinearity between ozone pollution concentrations. Dynamic programming (DP…”
Získat plný text
Journal Article -
18
On-Policy and Off-Policy Value Iteration Algorithms for Stochastic Zero-Sum Dynamic Games
ISSN: 1009-6124, 1559-7067Vydáno: Berlin/Heidelberg Springer Berlin Heidelberg 01.02.2025Vydáno v Journal of systems science and complexity (01.02.2025)“…This paper considers the value iteration algorithms of stochastic zero-sum linear quadratic games with unkown dynamics…”
Získat plný text
Journal Article -
19
An adaptive dynamic programming-based algorithm for infinite-horizon linear quadratic stochastic optimal control problems
ISSN: 1598-5865, 1865-2085Vydáno: Berlin/Heidelberg Springer Berlin Heidelberg 01.06.2023Vydáno v Journal of applied mathematics & computing (01.06.2023)“…This paper develops a novel adaptive dynamic programming (ADP)-based model-free policy iteration (PI…”
Získat plný text
Journal Article -
20
Pathwise Optimization for Optimal Stopping Problems
ISSN: 0025-1909, 1526-5501Vydáno: Hanover, MD INFORMS 01.12.2012Vydáno 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ískat plný text
Journal Article