Sciweavers

31 search results - page 4 / 7
» Sampled fictitious play for approximate dynamic programming
Sort
View
CDC
2010
IEEE
151views Control Systems» more  CDC 2010»
14 years 4 months ago
Convergence of discrete-time approximations of constrained linear-quadratic optimal control problems
Abstract-- Continuous-time linear constrained optimal control problems are in practice often solved using discretization techniques, e.g. in model predictive control (MPC). This re...
Lanshan Han, M. Kanat Camlibel, Jong-Shi Pang, W. ...
MANSCI
2007
100views more  MANSCI 2007»
14 years 9 months ago
Dynamic Assortment with Demand Learning for Seasonal Consumer Goods
Companies such as Zara and World Co. have recently implemented novel product development processes and supply chain architectures enabling them to make more product design and ass...
Felipe Caro, Jérémie Gallien
CIG
2005
IEEE
15 years 3 months ago
Nannon: A Nano Backgammon for Machine Learning Research
A newly designed game is introduced, which feels like Backgammon, but has a simplified rule set. Unlike earlier attempts at simplifying the game, Nannon maintains enough features a...
Jordan B. Pollack
ICCS
2003
Springer
15 years 2 months ago
Exploiting Stability to Reduce Time-Space Cost for Memory Tracing
Memory traces record the addresses touched by a program during its execution, enabling many useful investigations for understanding and predicting program performance. But complete...
Xiaofeng Gao, Allan Snavely
ALGORITHMICA
2005
195views more  ALGORITHMICA 2005»
14 years 9 months ago
Bit-Parallel Witnesses and Their Applications to Approximate String Matching
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
Heikki Hyyrö, Gonzalo Navarro