0
0.0
May 10, 2022
05/22
May 10, 2022
by
Dreyfus, Stuart E
texts
eye 0
favorite 0
comment 0
xv, 284 p. : 24 cm
Topic: Dynamic programming
0
0.0
May 2, 2022
05/22
May 2, 2022
texts
eye 0
favorite 0
comment 0
Purpose: This paper aims to propose a model for detecting the most profitable or the optimal Turning Points (TPs) existing in the history of the financial tool's time series. The profitable trading strategy, which is known as a tool for gaining profit in the Stock Exchange, is the strategy formed from the profitable trading points. Trading points, in the corresponding literature, are known as TPs. TPs prediction is a tool for the achievement of a profitable trading strategy. The first step...
Topic: Turning Points (TPs) detection Dynamic Programming (DP) Trading strategy Financial tool
3
3.0
Feb 26, 2022
02/22
Feb 26, 2022
by
In, Francis
texts
eye 3
favorite 0
comment 0
xii, 160 pages ; 23 cm
Topics: Agriculture -- Economic aspects, Macroeconomics, Landbouw, Econometrische modellen, Agriculture...
4
4.0
Feb 16, 2022
02/22
Feb 16, 2022
by
Bellman, Richard, 1920-1984
texts
eye 4
favorite 2
comment 0
1 online resource (363 pages) :
Topics: Dynamic programming, Programmation (Mathématiques), Théorie des jeux, MATHEMATICS -- Applied,...
4
4.0
Feb 4, 2022
02/22
Feb 4, 2022
by
Norman, John Malcolm
texts
eye 4
favorite 0
comment 0
vii, 92 p. : 22 cm
Topic: Dynamic programming
8
8.0
Jan 14, 2022
01/22
Jan 14, 2022
by
Cooper, Leon, 1924-
texts
eye 8
favorite 1
comment 0
ix, 289 p. : 26 cm
Topic: Dynamic programming
4
4.0
Nov 2, 2021
11/21
Nov 2, 2021
by
Hubert, Lawrence J., 1944-
texts
eye 4
favorite 0
comment 0
xi, 163 p. ; 27 cm
Topics: Dynamic programming, Combinatorial optimization
5
5.0
Sep 16, 2021
09/21
Sep 16, 2021
by
Hastings, N. A. J., 1937-
texts
eye 5
favorite 0
comment 0
[10], 173 p. 23 cm
Topic: Dynamic programming
Folkscanomy: General Academic Papers
13
13
Aug 23, 2021
08/21
Aug 23, 2021
by
International Journal of Power Electronics and Drive System (IJPEDS)
texts
eye 13
favorite 0
comment 0
This paper studies an approximate dynamic programming (ADP) strategy of a group of nonlinear switched systems, where the external disturbances are considered. The neural network (NN) technique is regarded to estimate the unknown part of actor as well as critic to deal with the corresponding nominal system. The training technique is simultaneously carried out based on the solution of minimizing the square error Hamilton function. The closed system’s tracking error is analyzed to converge to an...
Topics: Adaptive dynamic programming, HJB equation, Lyapunov, Neural networksstability, Nonlinear switched...
6,421
6.4K
Jul 20, 2021
07/21
Jul 20, 2021
by
MIT OpenCourseWare
movies
eye 6,421
favorite 10
comment 0
Instructor: Prof. Erik Demaine, Dr. Jason Ku, Prof. Justin Solomon View the complete course: https://ocw.mit.edu/6-006S20 YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP63EdVPNLG3ToM6LaEUuStEY This course is an introduction to mathematical modeling of computational problems, as well as common algorithms, algorithmic paradigms, and data structures used to solve these problems. It emphasizes the relationship between algorithms and programming and introduces basic performance...
Topics: 6.006, data structure, sorting, hashing, binary trees, breadth-first search, depth-first search,...
3
3.0
Jul 10, 2021
07/21
Jul 10, 2021
by
Fujita, Masahisa
texts
eye 3
favorite 0
comment 0
xvi, 335 p. : 25 cm
Topics: Regional economics -- Mathematical models, Dynamic programming
112
112
Jul 13, 2021
07/21
Jul 13, 2021
data
eye 112
favorite 0
comment 0
Udemy Intro To Dynamic Programming Coding Interview Preparation
Topic: Udemy Intro To Dynamic Programming Coding Interview Preparation
Source: torrent:urn:sha1:666358ce9bb1ade7dd2badd89c5693829fca317e
17
17
Apr 12, 2021
04/21
Apr 12, 2021
by
Bellman, Richard, 1920-1984
texts
eye 17
favorite 1
comment 0
1 online resource (xv, 246 pages)
Topics: Dynamic programming, Algorithms, Graph theory, MATHEMATICS -- Linear & Nonlinear Programming,...
6
6.0
Mar 27, 2021
03/21
Mar 27, 2021
by
Shahen Alexander Hovanessian, Louis Albert Pipes
image
eye 6
favorite 0
comment 0
Scan of book Digital computer methods in engineering by Shahen Alexander Hovanessian b19310906 & Louis Albert Pipes b1910 d1971 [1969] [620.0018--oclc]
Topics: Fast Fourier Transform, Numerical Calculus, Linear Programming, Dynamic Programming
20
20
Mar 19, 2021
03/21
Mar 19, 2021
by
Dao Phuong Nam, Nguyen Hong Quang, Tran Phuong Nam, Tran Thi Hai Yen
texts
eye 20
favorite 0
comment 0
In this paper, the optimal control problem of a nonlinear robot manipulator in absence of holonomic constraint force based on the point of view of adaptive dynamic programming (ADP) is presented. To begin with, the manipulator was intervened by exact linearization. Then the framework of ADP and Robust Integral of the Sign of the Error (RISE) was developed. The ADP algorithm employs Neural Network technique to tune simultaneously the actor-critic network to approximate the control policy and the...
Topics: Adaptive dynamic programming (ADP), Input constraint, Neural network, Robot manipulator, Robust...
The purpose of this thesis is to develop an algorithm for segmenting images corrupted by a high level of noise with different characteristics. In particular the images considered are composed of several regions describing different objects and background. The algorithm described is based on a Markov Random Field (MRF) model of the image and uses Kalman Filtering (KF) techniques and Dynamic Prograrnrning (DP) in order to smooth within the regions. The theoretical background for one dimensional...
Topics: Markov random field, Dynamic programming, Kalman filtering techniques
An application of control theory to an administrative problem is given for the case of a system of stored items which are periodically reworked to improve their reliability. Expressions are developed for the final value of the reliability when the system is stable and the limits of stability are found. A Kalman filter is used in the control model to obtain an estimation of the item reliability when there are random errors in the measurement and in the rework process. An extension is done for...
Topics: reliability control model, inventory management, control theory, Kalman filter, optimal control,...
This thesis presents a deterministic simulation model for the dynamic selection of offensive tactical movement routes. The factors which influence route selection are identified, and the performance objectives that are to be optimized are defined. Alternative modeling concepts are investigated, and one method is selected for implementation. The organization, data structure, and computational aspects that were developed to implement this concept are explained. A FORTRAN program listing of the...
Topics: Combat simulation, Dynamic programming, Route selection, STAR, Tactical movement
The replenishment of a dispersed battle group requires logistic ships to travel long distances between ships in the battle group. When operational requirements limit the amount of time that can be spent conducting replenishment, decision makers must select which ships to replenish based on the amount of time needed to transit between ships, and the combat value added to the battle group by replenishment. With proper assumptions, this problem in analogous to the Generalized Orienteering Problem....
Topics: Dynamic programming, Underway replenishment
In an era of modernization, new weapons systems generate new manpower requirements for the airborne community within the United States Army. The problem of forecasting yearly requirements and inventories has become increasingly complex. This thesis formulates a methodology which applies the Markov Theory to manpower planning in order to forecast yearly inventories. It also discusses zhe strategy of dynamic programming in determining the optimal numbers of soldiers with certain skill levels and...
Topics: Management, manpower, forecasting, optimization, Markov, Dynamic Programming, airborne, SOI, CMF/MOS
This thesis researches the feasibility of a TDA (tactical decision aid) to defend a high value surface unit from an enemy submarine. Accordingly, this research adopts a FAB (forward and backward) algorithm to search for a moving target. It develops a prototype of a TDA: FABTDA which gives an optimal allocation for search aircraft
Topics: Optimal search, FAB algorithm, dynamic programming
45
45
Dec 18, 2020
12/20
Dec 18, 2020
by
Bellman, Richard, 1920-1984
texts
eye 45
favorite 5
comment 0
xxv, 340 p. : 22 cm
Topic: Dynamic programming
15
15
Dec 19, 2020
12/20
Dec 19, 2020
texts
eye 15
favorite 0
comment 0
Ultimate goal of any industry is to make the profit, which obviously is to be maximised just by reducing the overall cost for the product. Various types of costs are associated with manufactured products. For sales promotion, salesmen have to travel from one place to another and that incurs high cost and also huge time investment. In this paper an effort is done to discuss the methods of Travelling salesman Problem (TSP) which reduces the total time or cost of travelling.
Topics: Hamiltonian cycle, Multigraph, Feasible solutions, Euclidean distances, Network, Dynamic...
7
7.0
Oct 25, 2020
10/20
Oct 25, 2020
by
White, D. J. (Douglas John)
texts
eye 7
favorite 0
comment 0
xiii, 204 p. ; 24 cm
Topics: Dynamic programming, Decision making, Markov processes
The purpose of this thesis is to present solution techniques for provisioning problems arising in the Navy's wholesale purchase of replacement parts. The objective is to minimize the Mean Supply Response Time (MSRT) subject to a budget constraint. The problem can be formulated as a Dynamic Program (DP), however, it is too large and complex for a standard recursive dynamic approach. Conseguently, a variation of the normal DP approach was developed that significantly reduces the required...
Topics: Wholesale provisoning, Dynamic programming
An analysis is made of the allocation problem associated with the conduct of ambush operations to interdict infiltration routes in a guerrilla-counterguerrilla environment. A multi-stage two-person non-zero sum game is used to model that allocation problem. It is shown that Lanchester's equations can be used to develop a criterion function, related to the casualty ratio, which demonstrates the minimax property. The game is then solved to determine the optimal allocations for both the guerrilla...
Topics: Counter-infiltration operations, Games of strategy, Allocation models, Lanchester equations,...
The fault location model under investigation consists of an n-component series system known to have exactly one failed component. Component positions in the system are taken as fixed. A component is either working or failed. Components work or fail independently of each other, with their a prior reliabilities taken as given but not necessarily equal. Group testing to locate the failed component is sequential, binary and dichotomous in nature with certain results. The only costs are the number...
Topics: Fault location model, Series system, Group testing, Information theory, Dynamic programming
6
6.0
Oct 5, 2020
10/20
Oct 5, 2020
texts
eye 6
favorite 0
comment 0
202 p. : 25 cm
Topics: Dynamic programming -- Congresses, Control theory -- Congresses
7
7.0
Oct 5, 2020
10/20
Oct 5, 2020
by
Boudarel, R. (René)
texts
eye 7
favorite 2
comment 0
xiv, 252 pages ; 24 cm
Topics: Control theory, Dynamic programming, Dynamische Optimierung, Kontrolltheorie, Optimale Kontrolle,...
13
13
Jun 8, 2020
06/20
Jun 8, 2020
by
Ross, Sheldon M
texts
eye 13
favorite 0
comment 0
xi, 164 p. ; 24 cm
Topics: Dynamic programming, Stochastic programming
Scientific Computation
Topics: optimal, tree, random, matrix, function, data, linear, algorithm, compute, solution, stock market,...
11
11
May 7, 2020
05/20
May 7, 2020
by
Sennott, Linn I., 1943-
texts
eye 11
favorite 2
comment 0
xiv, 328 pages : 25 cm
Topics: Controleleer, Wachttijdproblemen, Stochastische Optimierung, Dynamische Optimierung, Programmation...
67
67
May 6, 2020
05/20
May 6, 2020
by
Puterman, Martin L
texts
eye 67
favorite 1
comment 0
xvii, 649 pages : 25 cm
Topics: Markov processes, Statistical decision, Dynamic programming, Markov Chains, Stochastic Processes,...
11
11
May 8, 2020
05/20
May 8, 2020
by
Powell, Warren B., 1955-
texts
eye 11
favorite 2
comment 0
p. cm
Topic: Dynamic programming
Collection of books for Competitive programming
Topics: CP, CF, Codeforces, codechef, Competitve, programming, competitive programming, c++, c programming,...
5
5.0
May 11, 2020
05/20
May 11, 2020
by
Cairoli, R. (Renzo), 1931-1994
texts
eye 5
favorite 1
comment 0
xi, 327 pages ; 25 cm
Topics: Programmation dynamique, Arrêt optimal (Statistique mathématique), Stochastic processes,...
We present an algorithmc model for distributed computation of fixed points whereby several processors participate simultaneously in the calculations while exchanging information via communication links. We place essentially no assumption on the ordering of computation and communication between processors thereby allowing for completely uncoordinated execution. We find that even under these potentially chaotic circumstances it is possible to solve several important classes of problems including...
Topics: DTIC Archive, Bertsekas,Dimitri P, MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR INFORMATION AND...
We present an algorithmc model for distributed computation of fixed points whereby several processors participate simultaneously in the calculations while exchanging information via communication links. We place essentially no assumption on the ordering of computation and communication between processors thereby allowing for completely uncoordinated execution. We find that even under these potentially chaotic circumstances it is possible to solve several important classes of problems including...
Topics: DTIC Archive, Bertsekas,Dimitri P, MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR INFORMATION AND...
We present an algorithmc model for distributed computation of fixed points whereby several processors participate simultaneously in the calculations while exchanging information via communication links. We place essentially no assumption on the ordering of computation and communication between processors thereby allowing for completely uncoordinated execution. We find that even under these potentially chaotic circumstances it is possible to solve several important classes of problems including...
Topics: DTIC Archive, Bertsekas,Dimitri P, MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR INFORMATION AND...
We present an algorithmc model for distributed computation of fixed points whereby several processors participate simultaneously in the calculations while exchanging information via communication links. We place essentially no assumption on the ordering of computation and communication between processors thereby allowing for completely uncoordinated execution. We find that even under these potentially chaotic circumstances it is possible to solve several important classes of problems including...
Topics: DTIC Archive, Bertsekas,Dimitri P, MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR INFORMATION AND...
We present an algorithmc model for distributed computation of fixed points whereby several processors participate simultaneously in the calculations while exchanging information via communication links. We place essentially no assumption on the ordering of computation and communication between processors thereby allowing for completely uncoordinated execution. We find that even under these potentially chaotic circumstances it is possible to solve several important classes of problems including...
Topics: DTIC Archive, Bertsekas,Dimitri P, MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR INFORMATION AND...
We present an algorithmc model for distributed computation of fixed points whereby several processors participate simultaneously in the calculations while exchanging information via communication links. We place essentially no assumption on the ordering of computation and communication between processors thereby allowing for completely uncoordinated execution. We find that even under these potentially chaotic circumstances it is possible to solve several important classes of problems including...
Topics: DTIC Archive, Bertsekas,Dimitri P, MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR INFORMATION AND...
We present an algorithmc model for distributed computation of fixed points whereby several processors participate simultaneously in the calculations while exchanging information via communication links. We place essentially no assumption on the ordering of computation and communication between processors thereby allowing for completely uncoordinated execution. We find that even under these potentially chaotic circumstances it is possible to solve several important classes of problems including...
Topics: DTIC Archive, Bertsekas,Dimitri P, MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR INFORMATION AND...
We present an algorithmc model for distributed computation of fixed points whereby several processors participate simultaneously in the calculations while exchanging information via communication links. We place essentially no assumption on the ordering of computation and communication between processors thereby allowing for completely uncoordinated execution. We find that even under these potentially chaotic circumstances it is possible to solve several important classes of problems including...
Topics: DTIC Archive, Bertsekas,Dimitri P, MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR INFORMATION AND...
We present an algorithmc model for distributed computation of fixed points whereby several processors participate simultaneously in the calculations while exchanging information via communication links. We place essentially no assumption on the ordering of computation and communication between processors thereby allowing for completely uncoordinated execution. We find that even under these potentially chaotic circumstances it is possible to solve several important classes of problems including...
Topics: DTIC Archive, Bertsekas,Dimitri P, MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR INFORMATION AND...
We present an algorithmc model for distributed computation of fixed points whereby several processors participate simultaneously in the calculations while exchanging information via communication links. We place essentially no assumption on the ordering of computation and communication between processors thereby allowing for completely uncoordinated execution. We find that even under these potentially chaotic circumstances it is possible to solve several important classes of problems including...
Topics: DTIC Archive, Bertsekas,Dimitri P, MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR INFORMATION AND...
11
11
May 12, 2020
05/20
May 12, 2020
by
Ganz, Carl
texts
eye 11
favorite 0
comment 0
1 online resource (xii, 251 pages) :
Topics: Informatique, Electronic books, Microsoft .NET Framework, Application software -- Development,...
In this study we introduce and test several methods to reduce the computational cost in dynamic programming algorithms for isolated word recognition systems. Three methods will be discussed in detail: (1) Pruning by preset thresholds, (2) Search based on the Branch and Bound technique, (3) Branch and Bound based search with additional pruning. Compared to conventional algorithms, Method 3 could be seen to yield a speed up of approximately a factor of 5, at no loss of recognition accuracy. The...
Topics: DTIC Archive, Waibel, A, CARNEGIE-MELLON UNIV PITTSBURGH PA DEPT OF COMPUTER SCIENCE, *ALGORITHMS,...
In this study we introduce and test several methods to reduce the computational cost in dynamic programming algorithms for isolated word recognition systems. Three methods will be discussed in detail: (1) Pruning by preset thresholds, (2) Search based on the Branch and Bound technique, (3) Branch and Bound based search with additional pruning. Compared to conventional algorithms, Method 3 could be seen to yield a speed up of approximately a factor of 5, at no loss of recognition accuracy. The...
Topics: DTIC Archive, Waibel, A, CARNEGIE-MELLON UNIV PITTSBURGH PA DEPT OF COMPUTER SCIENCE, *ALGORITHMS,...
In this study we introduce and test several methods to reduce the computational cost in dynamic programming algorithms for isolated word recognition systems. Three methods will be discussed in detail: (1) Pruning by preset thresholds, (2) Search based on the Branch and Bound technique, (3) Branch and Bound based search with additional pruning. Compared to conventional algorithms, Method 3 could be seen to yield a speed up of approximately a factor of 5, at no loss of recognition accuracy. The...
Topics: DTIC Archive, Waibel, A, CARNEGIE-MELLON UNIV PITTSBURGH PA DEPT OF COMPUTER SCIENCE, *ALGORITHMS,...
