Back to Results
First PageMeta Content
Linear algebra / Dynamic programming / Markov processes / Stochastic control / Markov decision process / Linear programming / Mathematical optimization / Algorithm / Matrix / Mathematics / Algebra / Operations research


Planning in the Presence of Cost Functions Controlled by an Adversary H. Brendan McMahan Geoffrey J Gordon Avrim Blum
Add to Reading List

Document Date: 2003-06-24 09:15:18

Open Document

File Size: 300,81 KB

Share Result on Facebook

City

Pittsburgh / Washington DC / /

Company

Kaelbling L. P. / Single Oracle Double Oracle 120 Time / Oracle / John Wiley & sons / /

Country

United States / /

/

Facility

Brown University / Carnegie Mellon University / Rangos Hall / Brendan McMahan Geoffrey J Gordon Avrim Blum Carnegie Mellon University / /

IndustryTerm

direct solution / decomposition algorithms / online shortest path problem / maximin optimal solution / possible solution / iterative algorithm / online version / planning algorithms / minimax optimal solution / poly-time solution / tractable algorithms / optimization software / above algorithm / online setting / lower level navigation software / feasible solutions / /

Organization

Robotics Institute / National Science Foundation / Brown University / US government / Carnegie Mellon University / U.S. Securities and Exchange Commission / Pittsburgh PA / /

Person

Gordon Avrim Blum Carnegie / /

/

Position

planning player / row player / planner / player / row and column player / judge / column player / dynamics model / not the cost function / The row player / /

ProgrammingLanguage

Java / R / C / /

ProvinceOrState

Pennsylvania / /

PublishedMedium

Machine Learning / /

Technology

previous algorithm / laser / Java / http / decomposition algorithms / The algorithm / Machine Learning / direct LP algorithm / Decomposition The algorithm / /

URL

www.ilog.com/products/cplex/index.cfm / /

SocialTag