.:. Consultation > Liste par auteur > Teytaud .:.

72 documents classés par : Date Titre Nom du premier auteur Type de documents Date de dépôt

1 - 2 - 3 - 4 - 5

Noisy Optimization Complexity Under Locality Assumption Decock J., Teytaud O. Dans FOGA - Foundations of Genetic Algorithms XII - 2013 (2013) [hal-00755663 - version 1]

Computational Intelligence Meets the Game of Go @ IEEE WCCI 2012 Lee C.-S., Teytaud O., Wang M.-H., Yen S.-J. Computational Intelligence Magazine (2012) [hal-00744982 - version 1]

Strategic Choices: Small Budgets and Simple Regret Chou C.-W., Chou P.-C., Lee C.-S., Lupien Saint-Pierre D., Teytaud O., Wang M.-H., Wu L.-W., Yen S.-J. Dans TAAI (2012) [hal-00753145 - version 2]

Optimistic Heuristics for MineSweeper Buffet O., Lee C.-S., Lin W., Teytaud O. Dans ICS - International Computer Symposium - 2012 20 (2012) 199-207 [hal-00750577 - version 2]

The Grand Challenge of Computer Go: Monte Carlo Tree Search and Extensions Gelly S., Schoenauer M., Sebag M., Teytaud O., Kocsis L., Silver D., Szepesvari C. Communications- ACM 55, 3 (2012) 106-113 [hal-00695370 - version 3]

Combining Myopic Optimization and Tree Search: Application to MineSweeper Sebag M., Teytaud O. Dans LION6, Learning and Intelligent Optimization 7219 (2012) 222-236 [hal-00712417 - version 2]

Genetic fuzzy markup language for game of NoGo Lee C.-S., Wang M.-H., Chen Y.-J., Hagras H., Wu M.-J., Teytaud O. Knowledge base systems 34 (2012) 64-80 [hal-00766773 - version 1]

A simple Tsumego Generator Chou P.-C., Yen S.-J., Chou C.-W., Lin C.-N., Lee C.-S., Teytaud O., Doghmen H. Dans GPW (2012) [hal-00766190 - version 1]

Evolutionary Optimization of Low-Discrepancy Sequences Rainville F.-M. D., Gagné C., Teytaud O., Laurendeau D. ACM Transactions on Modeling and Computer Simulation 22, 2 (2012) 9:1-9:25 [hal-00758158 - version 1]

Fuzzy Ontologies for the Game of Go Lee C.-S., Wang M.-H., Teytaud O. Dans On Fuzziness. A Homage to Lotfi A. Zadeh, Springer (Ed.) (2012) 367-372 [hal-00758147 - version 1]

The Frontier of Decidability in Partially Observable Recursive Games David A., Teytaud O. International Journal on Foundations of Computer Science (IJFCS) Accepted (2012) [hal-00710073 - version 1]

A Rigorous Runtime Analysis for Quasi-Random Restarts and Decreasing Stepsize Schoenauer M., Teytaud F., Teytaud O. Dans Artificial Evolution (2011) [inria-00625855 - version 1]

Lower Bounds for Evolution Strategies Teytaud O. Dans Theory of Randomized Search Heuristics, World Scientific (Ed.) (2011) 327-354 [inria-00593179 - version 2]

Revisiting Monte-Carlo Tree Search on a Normal Form Game: NoGo Chou C.-W., Teytaud O., Yen S.-J. Dans EvoGames 2011 6624 (2011) 73-82 [inria-00593154 - version 1]

Handling Expensive Optimization with Large Noise Coulom R., Rolet P., Sokolovska N., Teytaud O. Dans Foundations of Genetic Algorithms (2011) TBA [hal-00517157 - version 2]