|
Search the dblp DataBase
Daniela Pucci de Farias:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Daniela Pucci de Farias, Benjamin Van Roy
Fixed Points of Approximate Value Iteration and Temporal-Difference Learning. [Citation Graph (0, 0)][DBLP] ICML, 2000, pp:207-214 [Conf]
- Daniela Pucci de Farias, Nimrod Megiddo
How to Combine Expert (and Novice) Advice when Actions Impact the Environment? [Citation Graph (0, 0)][DBLP] NIPS, 2003, pp:- [Conf]
- Daniela Pucci de Farias, Nimrod Megiddo
Exploration-Exploitation Tradeoffs for Experts Algorithms in Reactive Environments. [Citation Graph (0, 0)][DBLP] NIPS, 2004, pp:- [Conf]
- Daniela Pucci de Farias, Benjamin Van Roy
Approximate Dynamic Programming via Linear Programming. [Citation Graph (0, 0)][DBLP] NIPS, 2001, pp:689-695 [Conf]
- Daniela Pucci de Farias, Benjamin Van Roy
Approximate Linear Programming for Average-Cost Dynamic Programming. [Citation Graph (0, 0)][DBLP] NIPS, 2002, pp:1587-1594 [Conf]
- Daniela Pucci de Farias, Benjamin Van Roy
A Cost-Shaping LP for Bellman Error Minimization with Performance Guarantees. [Citation Graph (0, 0)][DBLP] NIPS, 2004, pp:- [Conf]
- Ion Muslea, Virginia Dignum, Daniel D. Corkill, Catholijn M. Jonker, Frank Dignum, Silvia Coradeschi, Alessandro Saffiotti, Dan Fu, Jeff Orkin, William Cheetham, Kai Goebel, Piero P. Bonissone, Leen-Kiat Soh, Randolph M. Jones, Robert E. Wray III, Matthias Scheutz, Daniela Pucci de Farias, Shie Mannor, Georgios Theocharous, Doina Precup, Bamshad Mobasher, Sarabjot S. Anand, Bettina Berendt, Andreas Hotho, Hans W. Guesgen, Michael T. Rosenstein, Mohammad Ghavamzadeh
The Workshop Program at the Nineteenth National Conference on Artificial Intelligence. [Citation Graph (0, 0)][DBLP] AI Magazine, 2005, v:26, n:1, pp:103-108 [Journal]
- Daniela Pucci de Farias, Nimrod Megiddo
Combining expert advice in reactive environments. [Citation Graph (0, 0)][DBLP] J. ACM, 2006, v:53, n:5, pp:762-799 [Journal]
- Daniela Pucci de Farias, Benjamin Van Roy
On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming. [Citation Graph (0, 0)][DBLP] Math. Oper. Res., 2004, v:29, n:3, pp:462-478 [Journal]
Choosing the cost vector of the linear programming approach to approximate dynamic programming. [Citation Graph (, )][DBLP]
Search in 0.001secs, Finished in 0.002secs
|