Approximate dynamic programming: solving the curses of dimensionality
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Hoboken, NJ
J. Wiley & Sons
2007
|
| Schriftenreihe: | Wiley series in probability and statistics
|
| Schlagworte: | |
| Online-Zugang: | Table of contents only Publisher description Contributor biographical information Inhaltsverzeichnis |
| Beschreibung: | Includes bibliographical references |
| Beschreibung: | XVI, 460 S. Ill., graph. Darst. |
| ISBN: | 9780470171554 |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV022954720 | ||
| 003 | DE-604 | ||
| 005 | 20180116 | ||
| 007 | t | ||
| 008 | 071109s2007 xxuad|| |||| 00||| eng d | ||
| 010 | |a 2007013724 | ||
| 020 | |a 9780470171554 |9 978-0-470-17155-4 | ||
| 035 | |a (OCoLC)122424955 | ||
| 035 | |a (DE-599)BVBBV022954720 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 044 | |a xxu |c US | ||
| 049 | |a DE-91G |a DE-384 |a DE-91 |a DE-703 |a DE-11 |a DE-29T |a DE-706 | ||
| 050 | 0 | |a T57.83 | |
| 082 | 0 | |a 519.7/03 | |
| 084 | |a QH 423 |0 (DE-625)141577: |2 rvk | ||
| 084 | |a SK 880 |0 (DE-625)143266: |2 rvk | ||
| 084 | |a SK 970 |0 (DE-625)143276: |2 rvk | ||
| 084 | |a ST 230 |0 (DE-625)143617: |2 rvk | ||
| 084 | |a MAT 917f |2 stub | ||
| 100 | 1 | |a Powell, Warren B. |d 1955- |e Verfasser |0 (DE-588)170298175 |4 aut | |
| 245 | 1 | 0 | |a Approximate dynamic programming |b solving the curses of dimensionality |c Warren B. Powell |
| 264 | 1 | |a Hoboken, NJ |b J. Wiley & Sons |c 2007 | |
| 300 | |a XVI, 460 S. |b Ill., graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Wiley series in probability and statistics | |
| 500 | |a Includes bibliographical references | ||
| 650 | 7 | |a Programação dinâmica |2 larpcal | |
| 650 | 4 | |a Dynamic programming | |
| 650 | 0 | 7 | |a Dynamische Optimierung |0 (DE-588)4125677-3 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Dynamische Optimierung |0 (DE-588)4125677-3 |D s |
| 689 | 0 | |5 DE-604 | |
| 856 | 4 | |u http://www.loc.gov/catdir/toc/ecip0714/2007013724.html |3 Table of contents only | |
| 856 | 4 | |u http://www.loc.gov/catdir/enhancements/fy0739/2007013724-d.html |3 Publisher description | |
| 856 | 4 | |u http://www.loc.gov/catdir/enhancements/fy0742/2007013724-b.html |3 Contributor biographical information | |
| 856 | 4 | 2 | |m GBV Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016159183&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-016159183 | ||
Datensatz im Suchindex
| _version_ | 1804137199102328832 |
|---|---|
| adam_text | APPROXIMATE DYNAMIC PROGRAMMING SOLVING THE CURSES OF DIMENSIONALITY
WARREN B. POWELL PRINCETON UNIVERSITY PRINCETON, NEW JERSEY BICENTENNIAL
B1CENTENNIAL WILEY-INTERSCIENCE A JOHN WILEY & SONS, INC., PUBLICATION
CONTENTS PREFACE XI ACKNOWLEDGMENTS XV 1 THE CHALLENGES OF DYNAMIC
PROGRAMMING 1 1.1 A DYNAMIC PROGRAMMING EXAMPLE: A SHORTEST PATH PROBLEM
2 1.2 THE THREE CURSES OF DIMENSIONALITY 3 1.3 SOME REAL APPLICATIONS 6
1.4 PROBLEM CLASSES 10 1.5 THE MANY DIALECTS OF DYNAMIC PROGRAMMING 12
1.6 WHAT IS NEW IN THIS BOOK? 14 1.7 BIBLIOGRAPHIE NOTES 16 2 SOME
ILLUSTRATIVE MODEIS 17 2.1 DETERMINISTIC PROBLEMS 18 2.2 STOCHASTIC
PROBLEMS 23 2.3 INFORMATION ACQUISITION PROBLEMS 36 2.4 A SIMPLE
MODELING FRAMEWORK FOR DYNAMIC PROGRAMS 40 2.5 BIBLIOGRAPHIE NOTES 43
PROBLEMS 43 V VI CONTENTS INTRODUCTION TO MARKOV DECISION PROCESSES 47
3.1 THE OPTIMALITY EQUATIONS 48 3.2 FINITE HORIZON PROBLEMS 53 3.3
INFINITE HORIZON PROBLEMS 55 3.4 VALUE ITERATION 57 3.5 POLICY ITERATION
61 3.6 HYBRID VALUE-POLICY ITERATION 63 3.7 THE LINEAR PROGRAMMING
METHOD FOR DYNAMIC PROGRAMS 63 3.8 MONOTONE POLICIES* 64 3.9 WHY DOES IT
WORK?** 70 3.10 BIBLIOGRAPHIE NOTES 85 PROBLEMS 86 INTRODUCTION TO
APPROXIMATE DYNAMIC PROGRAMMING 91 4.1 THE THREE CURSES OF
DIMENSIONALITY (REVISITED) 92 4.2 THE BASIC IDEA 93 4.3 SAMPLING RANDOM
VARIABLES 100 4.4 ADP USING THE POST-DECISION STATE VARIABLE 101 4.5
LOW-DIMENSIONAL REPRESENTATIONS OF VALUE FUNETIONS 107 4.6 SO JUST WHAT
IS APPROXIMATE DYNAMIC PROGRAMMING? 110 4.7 EXPERIMENTAL ISSUES 112 4.8
DYNAMIC PROGRAMMING WITH MISSING OR INCOMPLETE MODEIS 118 4.9
RELATIONSHIP TO REINFORCEMENT LEARNING 119 4.10 BUT DOES IT WORK? 120
4.11 BIBLIOGRAPHIE NOTES 122 PROBLEMS 123 MODELING DYNAMIC PROGRAMS 129
5.1 NOTATIONAL STYLE 131 5.2 MODELING TIME 132 5.3 MODELING RESOURCES
135 5.4 THE STATES OF OUR SYSTEM 139 5.5 MODELING DECISIONS 147 5.6
THE EXOGENOUS INFORMATION PROCESS 151 5.7 THE TRANSITION FUNETION 159
5.8 THE CONTRIBUTION FUNETION 166 5.9 THE OBJEETIVE FUNETION 169 5.10 A
MEASURE-THEORETIC VIEW OF INFORMATION** 170 5.11 BIBLIOGRAPHIE NOTES 173
PROBLEMS 173 CONTENTS VII 6 STOCHASTIC APPROXIMATION METHODS 179 6.1 A
STOCHASTIC GRADIENT ALGORITHM 181 6.2 DETERMINISTIC STEPSIZE RECIPES 183
6.3 STOCHASTIC STEPSIZES , 190 6.4 COMPUTING BIAS AND VARIANCE 195 6.5
OPTIMAL STEPSIZES 197 6.6 SOME EXPERIMENTAL COMPARISONS OF STEPSIZE
FORMULAS 204 6.7 CONVERGENCE 208 6.8 WHY DOES IT WORK?** 210 6.9
BIBLIOGRAPHIE NOTES 220 PROBLEMS 221 7 APPROXIMATING VALUE FUNETIONS 225
7.1 APPROXIMATION USING AGGREGATION 226 7.2 APPROXIMATION METHODS USING
REGRESSION MODEIS 237 7.3 RECURSIVE METHODS FOR REGRESSION MODEIS 246
7.4 NEURAL NETWORKS 253 7.5 VALUE FUNCTION APPROXIMATION FOR BATCH
PROCESSES 257 7.6 WHY DOES IT WORK?** 263 7.7 BIBLIOGRAPHIE NOTES 265
PROBLEMS 267 8 ADP FOR FINITE HORIZON PROBLEMS 271 8.1 STRATEGIES FOR
FINITE HORIZON PROBLEMS 272 8.2 Q-LEARNING 276 8.3 TEMPORAL DIFFERENCE
LEARNING 279 8.4 POLICY ITERATION 282 8.5 MONTE CARLO VALUE AND POLICY
ITERATION 284 8.6 THE ACTOR-CRITIC PARADIGM 285 8.7 BIAS IN VALUE
FUNCTION ESTIMATION 286 8.8 STATE SAMPLING STRATEGIES 290 8.9 STARTING
AND STOPPING 294 8.10 A TAXONOMY OF APPROXIMATE DYNAMIC PROGRAMMING
STRATEGIES 296 8.11 WHY DOES IT WORK** 298 8.12 BIBLIOGRAPHIE NOTES 298
PROBLEMS 299 9 INFINITE HORIZON PROBLEMS 303 9.1 FROM FINITE TO INFINITE
HORIZON 304 9.2 ALGORITHMIC STRATEGIES 304 9.3 STEPSIZES FOR INFINITE
HORIZON PROBLEMS 313 VIII CONTENTS 9.4 ERROR MEASURES 315 9.5 DIRECT ADP
FOR ON-LINE APPLICATIONS 317 9.6 FINITE HORIZON MODEIS FOR STEADY-STATE
APPLICATIONS 317 9.7 WHY DOES IT WORK?** 319 9.8 BIBLIOGRAPHIE NOTES 319
PROBLEMS 320 10 EXPLORATION VS. EXPLOITATION 323 10.1 A LEARNING
EXERCISE: THE NOMADIC TRUCKER 323 10.2 LEARNING STRATEGIES 326 10.3 A
SIMPLE INFORMATION ACQUISITION PROBLEM 330 10.4 GITTINS INDICES AND THE
INFORMATION ACQUISITION PROBLEM 332 10.5 VARIATIONS 337 10.6 THE
KNOWLEDGE GRADIENT ALGORITHM 339 10.7 INFORMATION ACQUISITION IN DYNAMIC
PROGRAMMING 342 10.8 BIBLIOGRAPHIE NOTES 346 PROBLEMS 346 11 VALUE
FUNCTION APPROXIMATIONS FOR SPECIAL FUNCTIONS 351 11.1 VALUE FUNETIONS
VERSUS GRADIENTS 352 11.2 LINEAR APPROXIMATIONS 353 11.3 PIECEWISE
LINEAR APPROXIMATIONS 355 11.4 THE SHAPE ALGORITHM 359 11.5 REGRESSION
METHODS 362 11.6 CUTTING PLANES* 365 11.7 WHY DOES IT WORK?** 377 11.8
BIBLIOGRAPHIE NOTES 383 PROBLEMS 384 12 DYNAMIC RESOURCE ALLOCATION
PROBLEMS 387 12.1 AN ASSET ACQUISITION PROBLEM 388 12.2 THE BLOOD
MANAGEMENT PROBLEM 392 12.3 A PORTFOLIO OPTIMIZATION PROBLEM 401 12.4 A
GENERAL RESOURCE ALLOCATION PROBLEM 404 12.5 A FLEET MANAGEMENT PROBLEM
416 12.6 A DRIVER MANAGEMENT PROBLEM 421 12.7 BIBLIOGRAPHIE REFERENCES
427 PROBLEMS 427 13 IMPLEMENTATION CHALLENGES 433 13.1 WILL ADP WORK FOR
YOUR PROBLEM? 433 CONTENTS IX 13.2 DESIGNING AN ADP ALGORITHM FOR
COMPLEX PROBLEMS 434 13.3 DEBUGGING AN ADP ALGORITHM 436 13.4
CONVERGENCE ISSUES 437 13.5 MODELING YOUR PROBLEM 438 13.6 ON-LINE VS.
OFF-LINE MODEIS 440 13.7 IF IT WORKS, PATENT IT! 441 INDEX , 457
|
| adam_txt |
APPROXIMATE DYNAMIC PROGRAMMING SOLVING THE CURSES OF DIMENSIONALITY
WARREN B. POWELL PRINCETON UNIVERSITY PRINCETON, NEW JERSEY BICENTENNIAL
B1CENTENNIAL WILEY-INTERSCIENCE A JOHN WILEY & SONS, INC., PUBLICATION
CONTENTS PREFACE XI ACKNOWLEDGMENTS XV 1 THE CHALLENGES OF DYNAMIC
PROGRAMMING 1 1.1 A DYNAMIC PROGRAMMING EXAMPLE: A SHORTEST PATH PROBLEM
2 1.2 THE THREE CURSES OF DIMENSIONALITY 3 1.3 SOME REAL APPLICATIONS 6
1.4 PROBLEM CLASSES 10 1.5 THE MANY DIALECTS OF DYNAMIC PROGRAMMING 12
1.6 WHAT IS NEW IN THIS BOOK? 14 1.7 BIBLIOGRAPHIE NOTES 16 2 SOME
ILLUSTRATIVE MODEIS 17 2.1 DETERMINISTIC PROBLEMS 18 2.2 STOCHASTIC
PROBLEMS 23 2.3 INFORMATION ACQUISITION PROBLEMS 36 2.4 A SIMPLE
MODELING FRAMEWORK FOR DYNAMIC PROGRAMS 40 2.5 BIBLIOGRAPHIE NOTES 43
PROBLEMS 43 V VI CONTENTS INTRODUCTION TO MARKOV DECISION PROCESSES 47
3.1 THE OPTIMALITY EQUATIONS 48 3.2 FINITE HORIZON PROBLEMS 53 3.3
INFINITE HORIZON PROBLEMS 55 3.4 VALUE ITERATION 57 3.5 POLICY ITERATION
61 3.6 HYBRID VALUE-POLICY ITERATION 63 3.7 THE LINEAR PROGRAMMING
METHOD FOR DYNAMIC PROGRAMS 63 3.8 MONOTONE POLICIES* 64 3.9 WHY DOES IT
WORK?** 70 3.10 BIBLIOGRAPHIE NOTES 85 PROBLEMS 86 INTRODUCTION TO
APPROXIMATE DYNAMIC PROGRAMMING 91 4.1 THE THREE CURSES OF
DIMENSIONALITY (REVISITED) 92 4.2 THE BASIC IDEA 93 4.3 SAMPLING RANDOM
VARIABLES 100 4.4 ADP USING THE POST-DECISION STATE VARIABLE 101 4.5
LOW-DIMENSIONAL REPRESENTATIONS OF VALUE FUNETIONS 107 4.6 SO JUST WHAT
IS APPROXIMATE DYNAMIC PROGRAMMING? 110 4.7 EXPERIMENTAL ISSUES 112 4.8
DYNAMIC PROGRAMMING WITH MISSING OR INCOMPLETE MODEIS 118 4.9
RELATIONSHIP TO REINFORCEMENT LEARNING 119 4.10 BUT DOES IT WORK? 120
4.11 BIBLIOGRAPHIE NOTES 122 PROBLEMS 123 MODELING DYNAMIC PROGRAMS 129
5.1 NOTATIONAL STYLE 131 5.2 MODELING TIME 132 5.3 MODELING RESOURCES
135 5.4 THE STATES OF OUR SYSTEM 139 5.5 MODELING DECISIONS 147 5.6
THE EXOGENOUS INFORMATION PROCESS 151 5.7 THE TRANSITION FUNETION 159
5.8 THE CONTRIBUTION FUNETION 166 5.9 THE OBJEETIVE FUNETION 169 5.10 A
MEASURE-THEORETIC VIEW OF INFORMATION** 170 5.11 BIBLIOGRAPHIE NOTES 173
PROBLEMS 173 CONTENTS VII 6 STOCHASTIC APPROXIMATION METHODS 179 6.1 A
STOCHASTIC GRADIENT ALGORITHM 181 6.2 DETERMINISTIC STEPSIZE RECIPES 183
6.3 STOCHASTIC STEPSIZES , 190 6.4 COMPUTING BIAS AND VARIANCE 195 6.5
OPTIMAL STEPSIZES 197 6.6 SOME EXPERIMENTAL COMPARISONS OF STEPSIZE
FORMULAS 204 6.7 CONVERGENCE ' 208 6.8 WHY DOES IT WORK?** 210 6.9
BIBLIOGRAPHIE NOTES 220 PROBLEMS 221 7 APPROXIMATING VALUE FUNETIONS 225
7.1 APPROXIMATION USING AGGREGATION 226 7.2 APPROXIMATION METHODS USING
REGRESSION MODEIS 237 7.3 RECURSIVE METHODS FOR REGRESSION MODEIS 246
7.4 NEURAL NETWORKS 253 7.5 VALUE FUNCTION APPROXIMATION FOR BATCH
PROCESSES 257 7.6 WHY DOES IT WORK?** 263 7.7 BIBLIOGRAPHIE NOTES 265
PROBLEMS 267 8 ADP FOR FINITE HORIZON PROBLEMS 271 8.1 STRATEGIES FOR
FINITE HORIZON PROBLEMS 272 8.2 Q-LEARNING 276 8.3 TEMPORAL DIFFERENCE
LEARNING 279 8.4 POLICY ITERATION 282 8.5 MONTE CARLO VALUE AND POLICY
ITERATION 284 8.6 THE ACTOR-CRITIC PARADIGM 285 8.7 BIAS IN VALUE
FUNCTION ESTIMATION 286 8.8 STATE SAMPLING STRATEGIES 290 8.9 STARTING
AND STOPPING 294 8.10 A TAXONOMY OF APPROXIMATE DYNAMIC PROGRAMMING
STRATEGIES 296 8.11 WHY DOES IT WORK** 298 8.12 BIBLIOGRAPHIE NOTES 298
PROBLEMS 299 9 INFINITE HORIZON PROBLEMS 303 9.1 FROM FINITE TO INFINITE
HORIZON 304 9.2 ALGORITHMIC STRATEGIES 304 9.3 STEPSIZES FOR INFINITE
HORIZON PROBLEMS 313 VIII CONTENTS 9.4 ERROR MEASURES 315 9.5 DIRECT ADP
FOR ON-LINE APPLICATIONS 317 9.6 FINITE HORIZON MODEIS FOR STEADY-STATE
APPLICATIONS 317 9.7 WHY DOES IT WORK?** 319 9.8 BIBLIOGRAPHIE NOTES 319
PROBLEMS 320 10 EXPLORATION VS. EXPLOITATION 323 10.1 A LEARNING
EXERCISE: THE NOMADIC TRUCKER 323 10.2 LEARNING STRATEGIES 326 10.3 A
SIMPLE INFORMATION ACQUISITION PROBLEM 330 10.4 GITTINS INDICES AND THE
INFORMATION ACQUISITION PROBLEM 332 10.5 VARIATIONS 337 10.6 THE
KNOWLEDGE GRADIENT ALGORITHM 339 10.7 INFORMATION ACQUISITION IN DYNAMIC
PROGRAMMING 342 10.8 BIBLIOGRAPHIE NOTES 346 PROBLEMS 346 11 VALUE
FUNCTION APPROXIMATIONS FOR SPECIAL FUNCTIONS 351 11.1 VALUE FUNETIONS
VERSUS GRADIENTS 352 11.2 LINEAR APPROXIMATIONS 353 11.3 PIECEWISE
LINEAR APPROXIMATIONS 355 11.4 THE SHAPE ALGORITHM 359 11.5 REGRESSION
METHODS 362 11.6 CUTTING PLANES* 365 11.7 WHY DOES IT WORK?** 377 11.8
BIBLIOGRAPHIE NOTES 383 PROBLEMS 384 12 DYNAMIC RESOURCE ALLOCATION
PROBLEMS 387 12.1 AN ASSET ACQUISITION PROBLEM 388 12.2 THE BLOOD
MANAGEMENT PROBLEM 392 12.3 A PORTFOLIO OPTIMIZATION PROBLEM 401 12.4 A
GENERAL RESOURCE ALLOCATION PROBLEM 404 12.5 A FLEET MANAGEMENT PROBLEM
416 12.6 A DRIVER MANAGEMENT PROBLEM 421 12.7 BIBLIOGRAPHIE REFERENCES
427 PROBLEMS 427 13 IMPLEMENTATION CHALLENGES 433 13.1 WILL ADP WORK FOR
YOUR PROBLEM? 433 CONTENTS IX 13.2 DESIGNING AN ADP ALGORITHM FOR
COMPLEX PROBLEMS 434 13.3 DEBUGGING AN ADP ALGORITHM 436 13.4
CONVERGENCE ISSUES 437 13.5 MODELING YOUR PROBLEM 438 13.6 ON-LINE VS.
OFF-LINE MODEIS 440 13.7 IF IT WORKS, PATENT IT! 441 INDEX , 457 |
| any_adam_object | 1 |
| any_adam_object_boolean | 1 |
| author | Powell, Warren B. 1955- |
| author_GND | (DE-588)170298175 |
| author_facet | Powell, Warren B. 1955- |
| author_role | aut |
| author_sort | Powell, Warren B. 1955- |
| author_variant | w b p wb wbp |
| building | Verbundindex |
| bvnumber | BV022954720 |
| callnumber-first | T - Technology |
| callnumber-label | T57 |
| callnumber-raw | T57.83 |
| callnumber-search | T57.83 |
| callnumber-sort | T 257.83 |
| callnumber-subject | T - General Technology |
| classification_rvk | QH 423 SK 880 SK 970 ST 230 |
| classification_tum | MAT 917f |
| ctrlnum | (OCoLC)122424955 (DE-599)BVBBV022954720 |
| dewey-full | 519.7/03 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 519 - Probabilities and applied mathematics |
| dewey-raw | 519.7/03 |
| dewey-search | 519.7/03 |
| dewey-sort | 3519.7 13 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik Wirtschaftswissenschaften |
| discipline_str_mv | Informatik Mathematik Wirtschaftswissenschaften |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02057nam a2200493zc 4500</leader><controlfield tag="001">BV022954720</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20180116 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">071109s2007 xxuad|| |||| 00||| eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="a">2007013724</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780470171554</subfield><subfield code="9">978-0-470-17155-4</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)122424955</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV022954720</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">xxu</subfield><subfield code="c">US</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-706</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">T57.83</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">519.7/03</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">QH 423</subfield><subfield code="0">(DE-625)141577:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 880</subfield><subfield code="0">(DE-625)143266:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 970</subfield><subfield code="0">(DE-625)143276:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 230</subfield><subfield code="0">(DE-625)143617:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 917f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Powell, Warren B.</subfield><subfield code="d">1955-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)170298175</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Approximate dynamic programming</subfield><subfield code="b">solving the curses of dimensionality</subfield><subfield code="c">Warren B. Powell</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Hoboken, NJ</subfield><subfield code="b">J. Wiley & Sons</subfield><subfield code="c">2007</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XVI, 460 S.</subfield><subfield code="b">Ill., graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Wiley series in probability and statistics</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Programação dinâmica</subfield><subfield code="2">larpcal</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Dynamic programming</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Dynamische Optimierung</subfield><subfield code="0">(DE-588)4125677-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Dynamische Optimierung</subfield><subfield code="0">(DE-588)4125677-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2=" "><subfield code="u">http://www.loc.gov/catdir/toc/ecip0714/2007013724.html</subfield><subfield code="3">Table of contents only</subfield></datafield><datafield tag="856" ind1="4" ind2=" "><subfield code="u">http://www.loc.gov/catdir/enhancements/fy0739/2007013724-d.html</subfield><subfield code="3">Publisher description</subfield></datafield><datafield tag="856" ind1="4" ind2=" "><subfield code="u">http://www.loc.gov/catdir/enhancements/fy0742/2007013724-b.html</subfield><subfield code="3">Contributor biographical information</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">GBV Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016159183&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-016159183</subfield></datafield></record></collection> |
| id | DE-604.BV022954720 |
| illustrated | Illustrated |
| index_date | 2024-07-02T19:02:52Z |
| indexdate | 2024-07-09T21:08:30Z |
| institution | BVB |
| isbn | 9780470171554 |
| language | English |
| lccn | 2007013724 |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-016159183 |
| oclc_num | 122424955 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM DE-384 DE-91 DE-BY-TUM DE-703 DE-11 DE-29T DE-706 |
| owner_facet | DE-91G DE-BY-TUM DE-384 DE-91 DE-BY-TUM DE-703 DE-11 DE-29T DE-706 |
| physical | XVI, 460 S. Ill., graph. Darst. |
| publishDate | 2007 |
| publishDateSearch | 2007 |
| publishDateSort | 2007 |
| publisher | J. Wiley & Sons |
| record_format | marc |
| series2 | Wiley series in probability and statistics |
| spelling | Powell, Warren B. 1955- Verfasser (DE-588)170298175 aut Approximate dynamic programming solving the curses of dimensionality Warren B. Powell Hoboken, NJ J. Wiley & Sons 2007 XVI, 460 S. Ill., graph. Darst. txt rdacontent n rdamedia nc rdacarrier Wiley series in probability and statistics Includes bibliographical references Programação dinâmica larpcal Dynamic programming Dynamische Optimierung (DE-588)4125677-3 gnd rswk-swf Dynamische Optimierung (DE-588)4125677-3 s DE-604 http://www.loc.gov/catdir/toc/ecip0714/2007013724.html Table of contents only http://www.loc.gov/catdir/enhancements/fy0739/2007013724-d.html Publisher description http://www.loc.gov/catdir/enhancements/fy0742/2007013724-b.html Contributor biographical information GBV Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016159183&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Powell, Warren B. 1955- Approximate dynamic programming solving the curses of dimensionality Programação dinâmica larpcal Dynamic programming Dynamische Optimierung (DE-588)4125677-3 gnd |
| subject_GND | (DE-588)4125677-3 |
| title | Approximate dynamic programming solving the curses of dimensionality |
| title_auth | Approximate dynamic programming solving the curses of dimensionality |
| title_exact_search | Approximate dynamic programming solving the curses of dimensionality |
| title_exact_search_txtP | Approximate dynamic programming solving the curses of dimensionality |
| title_full | Approximate dynamic programming solving the curses of dimensionality Warren B. Powell |
| title_fullStr | Approximate dynamic programming solving the curses of dimensionality Warren B. Powell |
| title_full_unstemmed | Approximate dynamic programming solving the curses of dimensionality Warren B. Powell |
| title_short | Approximate dynamic programming |
| title_sort | approximate dynamic programming solving the curses of dimensionality |
| title_sub | solving the curses of dimensionality |
| topic | Programação dinâmica larpcal Dynamic programming Dynamische Optimierung (DE-588)4125677-3 gnd |
| topic_facet | Programação dinâmica Dynamic programming Dynamische Optimierung |
| url | http://www.loc.gov/catdir/toc/ecip0714/2007013724.html http://www.loc.gov/catdir/enhancements/fy0739/2007013724-d.html http://www.loc.gov/catdir/enhancements/fy0742/2007013724-b.html http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016159183&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT powellwarrenb approximatedynamicprogrammingsolvingthecursesofdimensionality |