Approximate dynamic programming by minimizing distributionally robust bounds
La programacin̤ dinm̀ica aproximada (ADP) es un enfoque popular para resolver problemas extensos de decisin̤ markovianos. En este documento se describe un nuevo tipo de mťodos de tal enfoque programacin̤ dinm̀ica aproximada distribuidamente robusta que aborda el curso de la dimensionalidad al minim...
Saved in:
| Other Authors: | , |
|---|---|
| Format: | Book |
| Language: | English |
| Subjects: | |
| Online Access: | Approximate dynamic programming by minimizing distributionally robust bounds |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
MARC
| LEADER | 00000nam a22000004a 4500 | ||
|---|---|---|---|
| 001 | vpro7921 | ||
| 005 | 20201223000000.0 | ||
| 008 | 140612s2014 ck # g## #001 0#eng#d | ||
| 020 | |||
| 022 | |||
| 040 | |a CO-BoINGC | ||
| 041 | 0 | |a eng | |
| 245 | 1 | 0 | |a Approximate dynamic programming by minimizing distributionally robust bounds |
| 246 | |a Programacin̤ dinm̀ica aproximada minimizando lm̕ites distribuidamente robustos | ||
| 264 | |a Bogot ̀(Colombia) : |b Revista VirtualPRO, |c 2014 | ||
| 520 | 3 | |a La programacin̤ dinm̀ica aproximada (ADP) es un enfoque popular para resolver problemas extensos de decisin̤ markovianos. En este documento se describe un nuevo tipo de mťodos de tal enfoque programacin̤ dinm̀ica aproximada distribuidamente robusta que aborda el curso de la dimensionalidad al minimizar un lm̕ite pesimista. Esta alternativa convierte a la ADP en un problema de optimizacin̤, por lo cual se derivan nuevas formulaciones de programacin̤ matemt̀ica y se analizan sus propiedades. | |
| 650 | \ | \ | |a Administracin̤ |
| 650 | \ | \ | |a Administracin̤ de empresas |
| 650 | \ | \ | |a Investigacin̤ operacional |
| 650 | \ | \ | |a Optimizacin̤ matemt̀ica |
| 650 | \ | \ | |a Management |
| 650 | \ | \ | |a Business enterprises |
| 650 | \ | \ | |a Operations research |
| 650 | \ | \ | |a Mathematical optimization |
| 650 | \ | \ | |a Ciencias de la administracin̤ |
| 650 | \ | \ | |a Programacin̤ dinm̀ica |
| 650 | \ | \ | |a Programacin̤ dinm̀ica aproximada |
| 650 | \ | \ | |a Programacin̤ dinm̀ica aproximada distribuidamente robusta |
| 650 | \ | \ | |a Lm̕ite pesimista |
| 650 | \ | \ | |a Optimizacin̤ |
| 650 | \ | \ | |a Modelos computacionales |
| 650 | \ | \ | |a Administration sciences |
| 650 | \ | \ | |a Dynamic programming |
| 650 | \ | \ | |a Approximate dynamic programming |
| 650 | \ | \ | |a Distributed dynamically approximate dynamic programming |
| 650 | \ | \ | |a Pessimistic limit |
| 650 | \ | \ | |a Optimization |
| 650 | \ | \ | |a Computational models |
| 700 | \ | \ | |a Petrik Marek |
| 700 | \ | \ | |a International Conference on Machine Learning (ICML) |
| 856 | |z Approximate dynamic programming by minimizing distributionally robust bounds |u https://virtualpro.unach.elogim.com/biblioteca/programacion-dinamica-aproximada-minimizando-limites-distribuidamente-robustos | ||