Approximate dynamic programming by minimizing distributionally robust bounds

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

Ful tanımlama

Kaydedildi:
Detaylı Bibliyografya
Diğer Yazarlar: Petrik Marek, International Conference on Machine Learning (ICML)
Materyal Türü: Kitap
Dil:İngilizce
Konular:
Administracin̤
Administracin̤ de empresas
Investigacin̤ operacional
Optimizacin̤ matemt̀ica
Management
Business enterprises
Operations research
Mathematical optimization
Ciencias de la administracin̤
Programacin̤ dinm̀ica
Programacin̤ dinm̀ica aproximada
Programacin̤ dinm̀ica aproximada distribuidamente robusta
Lm̕ite pesimista
Optimizacin̤
Modelos computacionales
Administration sciences
Dynamic programming
Approximate dynamic programming
Distributed dynamically approximate dynamic programming
Pessimistic limit
Optimization
Computational models
Online Erişim:Approximate dynamic programming by minimizing distributionally robust bounds
Etiketler: Etiketle
Etiket eklenmemiş, İlk siz ekleyin!

Internet

Approximate dynamic programming by minimizing distributionally robust bounds

Benzer Materyaller