#### Filter Results:

- Full text PDF available (210)

#### Publication Year

1970

2017

- This year (3)
- Last 5 years (71)
- Last 10 years (158)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

#### Key Phrases

Learn More

- Jennie Si, Andy Barto, +5 authors JAMES C. NEIDHOEFER
- 2004

Stochastic optimization problems pose unique challenges in how they are represented mathematically. These problems arise in a number of different communities, often in the context of problems that introduce specific computational characteristics. As a result, a number of contrasting notational styles have evolved, which complicate our ability to communicate… (More)

- Peter I. Frazier, Warren B. Powell, Savas Dayanik
- INFORMS Journal on Computing
- 2009

We consider a Bayesian ranking and selection problem with independent normal rewards and a correlated multivariate normal belief on the mean values of these rewards. Because this formulation of the ranking and selection problem models dependence between alternatives’ mean values, algorithms may utilize this dependence to perform efficiently even when the… (More)

- Abraham P. George, Warren B. Powell
- Machine Learning
- 2006

We address the problem of determining optimal stepsizes for estimating parameters in the context of approximate dynamic programming. The sufficient conditions for convergence of the stepsize rules have been known for 50 years, but practical computational work tends to use formulas with parameters that have to be tuned for specific applications. The problem… (More)

- Gregory A. Godfrey, Warren B. Powell
- Transportation Science
- 2002

In a companion paper (Godfrey and Powell 2002) we introduced an adaptive dynamic programming algorithm for stochastic dynamic resource allocation problems, which arise in the context of logistics and distribution, fleet management, and other allocation problems. The method depends on estimating separable nonlinear approximations of value functions, using a… (More)

- Zhi-Long Chen, Warren B. Powell
- INFORMS Journal on Computing
- 1999

We consider a class of problems of scheduling n jobs on m identical, uniform, or unrelated parallel machines with an objective of minimizing an additive criterion. We propose a decomposition approach for solving these problems exactly. The decomposition approach rst formulates these problems as an integer program, and then reformulates the integer program,… (More)

- Warren B. Powell
- Transportation Science
- 1996

The dynamic assignment problem arises in a number of application areas in transportation and logistics. Taxi drivers have to be assigned to pick up passengers, police have to be assigned to emergencies, and truck drivers have to pick up and carry loads of freight. All of these problems are characterized by demands that arrive continuously and randomly… (More)

- Lauren Hannah, David M. Blei, Warren B. Powell
- Journal of Machine Learning Research
- 2010

We propose Dirichlet Process mixtures of Generalized Linear Models (DP-GLM), a new class of methods for nonparametric regression. Given a data set of input-response pairs, the DP-GLM produces a global model of the joint distribution through a mixture of local generalized linear models. DP-GLMs allow both continuous and categorical inputs, and can model the… (More)

- Ilya O. Ryzhov, Warren B. Powell, Peter I. Frazier
- Operations Research
- 2012

We derive a one-period look-ahead policy for finiteand infinite-horizon online optimal learning problems with Gaussian rewards. Our approach is able to handle the case where our prior beliefs about the rewards are correlated, which is not handled by traditional multi-armed bandit methods. Experiments show that our KG policy performs competitively against… (More)

- Jae Ho Kim, Warren B. Powell
- Operations Research
- 2011

We formulate and solve the problem of making advance energy commitments for wind farms in the presence of a storage device with conversion losses, mean-reverting price process, and an auto-regressive energy generation process from wind. We derive an optimal commitment policy under the assumption that wind energy is uniformly distributed. Then, the… (More)