PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Teytaud, Olivier"

Author of the publication

copydeleteadd this publication to your clipboard
The Nash and the bandit approaches for adversarial portfolios.

, and . CIG, page 1-7. IEEE, (2014)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Teytaud, Olivier
add a person with the name Teytaud, Olivier
 

Other publications of authors with the same name

The Frontier of Decidability in Partially Observable Recursive Games., and . Int. J. Found. Comput. Sci., 23 (7): 1439-1450 (2012)Lower Bounds for Comparison Based Evolution Strategies Using VC-dimension and Sign Patterns., and . Algorithmica, 59 (3): 387-408 (2011)The Nash and the bandit approaches for adversarial portfolios., and . CIG, page 1-7. IEEE, (2014)Taylor-based pseudo-metrics for random process fitting in dynamic programming: expected loss minimization and risk management., , and . CAP, page 183-184. PUG, (2005)Algorithm portfolios for noisy optimization., , , and . Ann. Math. Artif. Intell., 76 (1-2): 143-172 (2016)Slightly Beyond Turing's Computability for Studying Genetic Programming.. MCU, volume 4664 of Lecture Notes in Computer Science, page 279-290. Springer, (2007)Upper Confidence Tree-Based Consistent Reactive Planning Application to MineSweeper., and . LION, volume 7219 of Lecture Notes in Computer Science, page 220-234. Springer, (2012)Bandit-Based Estimation of Distribution Algorithms for Noisy Optimization: Rigorous Runtime Analysis., and . LION, volume 6073 of Lecture Notes in Computer Science, page 97-110. Springer, (2010)QR Mutations Improve Many Evolution Strategies: A Lot On Highly Multimodal Problems., and . GECCO (Companion), page 35-36. ACM, (2016)Noisy optimization complexity under locality assumption., and . FOGA, page 183-190. ACM, (2013)