11
11

Aug 27, 2019
08/19

by
Kaufmann, A. (Arnold), 1911-

texts

######
eye 11

######
favorite 2

######
comment 0

xv, 278 p. 24 cm

Topic: Dynamic programming

103
103

Nov 4, 2014
11/14

by
Bellman, Richard, 1920-1984; Dreyfus, Stuart E., joint author

texts

######
eye 103

######
favorite 1

######
comment 0

Includes bibliography

Topic: Dynamic programming

5
5.0

texts

######
eye 5

######
favorite 0

######
comment 0

v, 56 p. : 28 cm

Topic: Dynamic programming

3
3.0

May 8, 2020
05/20

by
Powell, Warren B., 1955-

texts

######
eye 3

######
favorite 0

######
comment 0

p. cm

Topic: Dynamic programming

23
23

Aug 27, 2019
08/19

by
Aris, Rutherford

texts

######
eye 23

######
favorite 0

######
comment 0

x, 148 p. 24 cm

Topic: Dynamic programming

346
346

Jun 20, 2010
06/10

by
Schulz, W.; Schulze, H.-K

texts

######
eye 346

######
favorite 0

######
comment 0

Dynamic programming for optimization of flight mechanics problems

Topics: DYNAMIC PROGRAMMING, FLIGHT MECHANICS, OPTIMIZATION, DYNAMIC PROGRAMMING, FLIGHT MECHANICS,...

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

139
139

Jun 18, 2010
06/10

by
Nemhauser, George L

texts

######
eye 139

######
favorite 1

######
comment 0

Bibliography: p. 248-251

Topics: Dynamic programming, Dynamische Optimierung

69
69

Oct 5, 2015
10/15

by
Badal, Dusan Z.;Gehl, Michael T.

texts

######
eye 69

######
favorite 0

######
comment 0

"NPS-52-82-001"--Cover

Topic: DYNAMIC PROGRAMMING.,MATHEMATICAL OPTIMIZATION.

10
10.0

Mar 26, 2014
03/14

by
Larson, Robert Edward

texts

######
eye 10

######
favorite 0

######
comment 0

Includes bibliographies

Topics: Dynamic programming, Mathematical optimization

702
702

Sep 10, 2008
09/08

by
Low, Gilbert W. (Gilbert William)

texts

######
eye 702

######
favorite 0

######
comment 0

Includes bibliographical references

Topics: Dynamic programming, Systems engineering

Dynamic Programming and Partial Differential Equations

Topics: Dynamic Programming, Operation Research

2
2.0

Jun 8, 2020
06/20

by
Ross, Sheldon M

texts

######
eye 2

######
favorite 0

######
comment 0

xi, 164 p. ; 24 cm

Topics: Dynamic programming, Stochastic programming

"NPS-52-82-001"--Cover

Topics: DYNAMIC PROGRAMMING., MATHEMATICAL OPTIMIZATION.

26
26

Aug 16, 2019
08/19

by
Danø, Sven

texts

######
eye 26

######
favorite 1

######
comment 0

164 p. : 24 cm

Topics: Dynamic programming, Nonlinear programming

24
24

Feb 21, 2019
02/19

by
Bertsekas, Dimitri P

texts

######
eye 24

######
favorite 0

######
comment 0

xv, 397 p. : 24 cm

Topics: Dynamic programming, Stochastic processes

Click here to view the University of Florida catalog record

Topics: Dynamic programming, Production planning

35
35

Aug 27, 2019
08/19

by
Howard, Ronald A

texts

######
eye 35

######
favorite 1

######
comment 0

136 p. : 24 cm

Topics: Dynamic programming, Markov processes

We present an algorithm to approximately solve certain stochastic nonlinear programs through sample average approximations. The sample sizes in these approximations are selected by approximately solving optimal control problems defined on a discrete-time dynamic system. The optimal-control problem seeks to minimize the computational effort required to reach a near-optimal objective value of the stochastic nonlinear program. Unknown control-problem parameters such as rate of convergence,...

Topics: Stochastic analysis, Dynamic programming

53
53

Jun 15, 2019
06/19

by
Bather, John

texts

######
eye 53

######
favorite 1

######
comment 0

ix, 191 p. : 23 cm

Topics: Decision making, Dynamic programming

9
9.0

Mar 4, 2020
03/20

by
Nemhauser, George L

texts

######
eye 9

######
favorite 0

######
comment 0

xiii, 256 pages : 24 cm

Topics: Dynamic programming, Dynamic programming, Dynamische Optimierung, dynamisch programmeren, dynamic...

1
1.0

texts

######
eye 1

######
favorite 0

######
comment 0

202 p. : 25 cm

Topics: Dynamic programming -- Congresses, Control theory -- Congresses

Dynamic Programming and Modern Control Theory by Richard Bellman, Robert Kalaba

Topics: Modern control, dynamic programming, game theory

University of Illinois Urbana-Champaign

312
312

Mar 26, 2013
03/13

by
Adams, Harold Corwin; University of Illinois at Urbana-Champaign. Dept. of Computer Science

texts

######
eye 312

######
favorite 0

######
comment 0

Originally presented as the author's thesis (M.S.)--University of Illinois at Urbana-Champaign, 1971

Topics: OL/2 (Computer program language), Dynamic programming

University of Illinois Urbana-Champaign

173
173

Mar 26, 2013
03/13

by
Latch, John Lockhart; University of Illinois at Urbana-Champaign. Dept. of Computer Science

texts

######
eye 173

######
favorite 0

######
comment 0

Originally published as the author's thesis (M.S.)--University of Illinois at Urbana-Champaign, 1971

Topics: Dynamic programming, OL/2 (Computer program language)

Operational commanders and planners are challenged with maintaining fleet presence in many environments with limited resources. To add to this challenge, there are further constraints placed upon assets allocated to a given operational commander such as replenishments at sea, multinational exercises, diplomatic port visits, and predetermined in-chop and out-chop dates. In the case of the Combined Maritime Force (CMF), which operates in the FIFTH FLEET Area of Responsibility, these constraints...

Topics: Dynamic programming, Network analysis (Planning), Mathematical optimization

2,885
2.9K

Jul 14, 2017
07/17

by
Nancy L. Stokey & Robert E. Lucas, Jr.

texts

######
eye 2,885

######
favorite 0

######
comment 0

This rigorous but brilliantly lucid book presents a self-contained treatment of modern economic dynamics. Nancy L. Stokey , Robert E. Lucas, Jr. , and Edward C. Prescott develop the basic methods of recursive analysis and illustrate the many areas where they can usefully be applied. After presenting an overview of the recursive approach, the authors develop economic applications for deterministic dynamic programming and the stability theory of first-order difference equations. They then treat...

Topics: Economics, Dynamic Programming, Deterministic vs Stochastic Dynamics

Biodiversity Heritage Library

2,264
2.3K

Sep 10, 2010
09/10

by
Timman, R. (Reinier), 1917-1975; David W. Taylor Naval Ship Research and Development Center

texts

######
eye 2,264

######
favorite 0

######
comment 0

Cover title

Topics: Control theory, Calculus of variations, Dynamic programming

Naval Postgraduate School

15
15

May 4, 2019
05/19

by
Nigus, Christopher A.; McCadden, Kevin K.

texts

######
eye 15

######
favorite 0

######
comment 0

As unmanned aerial vehicle (UAV) technology and availability improves, it becomes increasingly more important to operate UAVs efficiently. Utilizing one UAV at a time is a relatively simple task, but when multiple UAVs need to be coordinated, optimal search plans can be difficult to create in a timely manner. In this thesis, we create a decision aid that generates efficient routes for multiple UAVs using dynamic programming and a limited-lookahead heuristic. The goal is to give the user the...

Topics: Drone aircraft, United States, Search theory, Dynamic programming

47
47

Oct 8, 2015
10/15

by
Russak, Ira Bert.

texts

######
eye 47

######
favorite 0

######
comment 0

Final report for 1973 -- Cover.

Topic: GAMES OF STRATEGY (MATHEMATICS),DYNAMIC PROGRAMMING.,WAR GAMES.

Final report for 1973 -- Cover.

Topics: GAMES OF STRATEGY (MATHEMATICS), DYNAMIC PROGRAMMING., WAR GAMES.

A survey of the methods of solving the integer program, max summation from j=1 to j=n of the quantity (c sub j x sub j) subject to summation, j=1 to j=n of the quantity (a sub ij x sub j) = b sub i, i=1,...,m, and x sub j = or 0 and integer (j=1,...,n) is presented. Emphasis is placed on methods developed since 1960 with many as yet unpublished methods presented. Examples are given for the unpublished methods.

Topics: integer programming, knapsack functions, dynamic programming, bounded variables

In this thesis, a new fictitious play (FP) procedure is presented to solve two-person zero-sum (TPZS) Blotto games. The FP solution procedure solves TPZS games by assuming that the two players take turns selecting optimal responses to the opponent's strategy observed so far. It is known that FP converges to an optimal solution, and it may be the only realistic approach to solve large games. The algorithm uses dynamic programming (DP) to solve FP subproblems. Efficiency is obtained by limiting...

Topics: Two-person zero-sum games, Dynamic programming, Fictitious Play, New FP Procedure, Two Person Zero...

Title from cover

Topics: DYNAMIC PROGRAMMING PROBLEMS, EXERCISES, ETC., GAMES OF STRATEGY (MATHEMATICS)

Flows in Networks by L. R. Ford, JR, and D. R. Fulkerson

Topics: Flows in Network, Graph Theory, Maximal Flow, Dynamic Programming

366
366

Jun 20, 2010
06/10

by
Steinmetz, G

texts

######
eye 366

######
favorite 0

######
comment 0

Determining fuel-optimum ascent trajectories in vacuum - classical calculus of variations, Pontryagin maximum principle, dynamic programming, and gradient method

Topics: ASCENT TRAJECTORIES, PONTRYAGIN PRINCIPLE, VARIATIONAL CALCULUS, CALCULUS OF VARIATIONS, DYNAMIC...

225
225

texts

######
eye 225

######
favorite 0

######
comment 0

This paper presents a new approach to solving the short-term unit commitment problem using an improved Particle Swarm Optimization (IPSO). The objective of this paper is to find the generation scheduling such that the total operating cost can be minimized, when subjected to a variety of constraints. This also means that it is desirable to find the optimal generating unit commitment in the power system for the next H hours. PSO, which happens to be a Global Optimization technique for solving...

Topics: Unit Commitment, Particle Swarm Optimization, Legrangian Relaxation, Dynamic Programming

266
266

Jun 9, 2011
06/11

by
Horvath, Thomas J.; Berry, Scott A.; Hollis, Brian R.; Liechty, Derek S.; Hamilton, H. Harris, II; Merski, N. Ronal

texts

######
eye 266

######
favorite 0

######
comment 0

The goal of the NASA Reusable Launch Vehicle (RLV) technology program is to mature and demonstrate essential, cost effective technologies for next generation launch systems. The X-33 flight vehicle presently being developed by Lockheed Martin is an experimental Single Stage to Orbit (SSTO) demonstrator that seeks to validate critical technologies and insure applicability to a full scale RLV. As with the design of any hypersonic vehicle, the aeroheating environment is an important issue and one...

Topics: DYNAMIC PROGRAMMING, MARKOV PROCESSES, DECISION THEORY, ALGORITHMS, CONTROL THEORY

596
596

Jul 23, 2012
07/12

by
Harshita G. Patil, Manish Narnaware

texts

######
eye 596

######
favorite 0

######
comment 0

This Project shows a comparison survey done on DNA sequence comparison techniques. The various techniques implemented are sequential comparison, multithreading on a single computer and multithreading using parallel processing. This Project shows the issues involved in implementing a dynamic programming algorithm for biological sequence comparison on a general purpose parallel computing platform Tiling is an important technique for extraction of parallelism. Informally, tiling consists of...

Topics: Dynamic Programming Algorithms, FASTA, Sequences Alignment, Tiling, ijorcs, ijorcs.org

56
56

Oct 6, 2015
10/15

by
Smith, Douglas R.

texts

######
eye 56

######
favorite 0

######
comment 0

Title from cover

Topic: DYNAMIC PROGRAMMING PROBLEMS, EXERCISES, ETC.,GAMES OF STRATEGY (MATHEMATICS)

189
189

Jun 19, 2010
06/10

by
Melbourne, W. G

texts

######
eye 189

######
favorite 0

######
comment 0

Conjugate point and dynamic programming

Topics: ASYMPTOTES, VARIATIONAL CALCULUS, CALCULUS OF VARIATIONS, CONJUGATES, DIFFERENTIAL EQUATIONS,...

136
136

texts

######
eye 136

######
favorite 0

######
comment 0

The paper evaluates the potentials for conjunctive use of surface water and groundwater resources to meet the present and future water demand of the University of Benin, Benin City, Edo state, Nigeria. A discrete dynamic model was developed and applied to predict the demand, consumption and net benefit of the conjunctive use of the two sources. In the model, allocations each user was assumed to represent a stage in the sequence of decisions. Three decision...

Topics: Discrete Dynamic Programming, Surface Water Resources, Groundwater Resources, Net Benefit

Over the last ten years, research in the field of dynamic programming has assumed many different forms. Sometimes, the emphasis has been upon questions of formulation in analytic terms and concepts, sometimes upon the problems of existence and uniqueness of solutions of the functional equations derived from the underlying processes, occasionally upon the actual analytic structure of the solutions of these equations, sometimes upon the computational aspects; and sometimes upon the...

Topics: DTIC Archive, RAND CORP SANTA MONICA CA, *DYNAMIC PROGRAMMING, THEORY

Journal of Research of the National Bureau of Standards

Topics: Combinatorics, dynamic programming, optimization, systems of distinct representatives, theory of...

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

We study decision making in dynamic environments in general, and human motor learning in particular. Our approach focuses on the acquisition and use of libraries of representational primitives. This approach is motivated by computational considerations -- learning new motor plans by linearly combining primitives from a library ameliorates the curse of dimensionality. It is also motivated by evidence from the field of cognitive neuroscience indicating that biological organisms (including humans)...

Topics: DTIC Archive, ROCHESTER UNIV NY, *MOTOR REACTIONS, DECISION MAKING, DYNAMIC PROGRAMMING, LEARNING

Documents created and distributed on the Internet are ever changing in various forms. Most of existing works are devoted to topic modeling and the evolution of individual topics, while sequential relations of topics in successive documents published by a specific user are ignored. In order to characterize and detect personalized and abnormal behaviors of Internet users, we propose Sequential Topic Patterns (STPs) and formulate the problem of mining Useraware Rare Sequential Topic Patterns...

Topics: Web mining, sequential patterns, document streams, rare events, pattern-growth, dynamic programming

0
0.0

Oct 5, 2020
10/20

by
Boudarel, R. (René)

texts

######
eye 0

######
favorite 0

######
comment 0

xiv, 252 pages ; 24 cm

Topics: Control theory, Dynamic programming, Dynamische Optimierung, Kontrolltheorie, Optimale Kontrolle,...

1,545
1.5K

Jul 26, 2010
07/10

by
NON

texts

######
eye 1,545

######
favorite 0

######
comment 0

Topics addressed include: high-temperature composite materials; structural mechanics; fatigue life prediction for composite materials; internal computational fluid mechanics; instrumentation and controls; electronics; stirling engines; aeropropulsion and space propulsion programs, including a study of slush hydrogen; space power for use in the space station, in the Mars rover, and other applications; thermal management; plasma and radiation; cryogenic fluid management in space; microgravity...

Topics: AIRCRAFT PERFORMANCE, DECOMPOSITION, DYNAMIC PROGRAMMING, OPTIMIZATION, SENSITIVITY, ALGORITHMS,...

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,...