| 2012 | ||
|---|---|---|
| j20 | Sylvain Gelly, Levente Kocsis, Marc Schoenauer, Michèle Sebag, David Silver, Csaba Szepesvári, Olivier Teytaud: The grand challenge of computer Go: Monte Carlo tree search and extensions. Commun. ACM 55(3): 106-113 (2012) | |
| j19 | Chang-Shing Lee, Olivier Teytaud, Mei-Hui Wang, Shi-Jim Yen: Computational Intelligence Meets Game of Go @ IEEE WCCI 2012 [Society Briefs]. IEEE Comp. Int. Mag. 7(4): 10-12 (2012) | |
| j18 | David Auger, Olivier Teytaud: The Frontier of Decidability in Partially Observable Recursive Games. Int. J. Found. Comput. Sci. 23(7): 1439-1450 (2012) | |
| j17 | Chang-Shing Lee, Mei-Hui Wang, Yu-Jen Chen, Hani Hagras, Meng-Jhen Wu, Olivier Teytaud: Genetic fuzzy markup language for game of NoGo. Knowl.-Based Syst. 34: 64-80 (2012) | |
| j16 | François-Michel De Rainville, Christian Gagné, Olivier Teytaud, Denis Laurendeau: Evolutionary optimization of low-discrepancy sequences. ACM Trans. Model. Comput. Simul. 22(2): 9 (2012) | |
| c66 | Michèle Sebag, Olivier Teytaud: Upper Confidence Tree-Based Consistent Reactive Planning Application to MineSweeper. LION 2012: 220-234 | |
| c65 | Adrien Couëtoux, Hassen Doghmen, Olivier Teytaud: Improving the Exploration in Upper Confidence Trees. LION 2012: 366-371 | |
| 2011 | ||
| j15 | Hervé Fournier, Olivier Teytaud: Lower Bounds for Comparison Based Evolution Strategies Using VC-dimension and Sign Patterns. Algorithmica 59(3): 387-408 (2011) | |
| j14 | Adrien Couëtoux, Mario Milone, Mátyás Brendel, Hassen Doghmen, Michèle Sebag, Olivier Teytaud: Continuous RAVE. Journal of Machine Learning Research - Proceedings Track 20: 19-31 (2011) | |
| c64 | Cheng-Wei Chou, Ping-Chiang Chou, Hassen Doghmen, Chang-Shing Lee, Tsan-Cheng Su, Fabien Teytaud, Olivier Teytaud, Hui-Min Wang, Mei-Hui Wang, Li-Wen Wu, Shi-Jim Yen: Towards a Solution of 7x7 Go with Meta-MCTS. ACG 2011: 84-95 | |
| c63 | David Lupien St-Pierre, Quentin Louveaux, Olivier Teytaud: Online Sparse Bandit for Card Games. ACG 2011: 295-305 | |
| c62 | Marc Schoenauer, Fabien Teytaud, Olivier Teytaud: A Rigorous Runtime Analysis for Quasi-Random Restarts and Decreasing Stepsize. Artificial Evolution 2011: 37-48 | |
| c61 | Ping-Chiang Chou, Hassen Doghmen, Chang-Shing Lee, Fabien Teytaud, Olivier Teytaud, Hui-Min Wang, Mei-Hui Wang, Li-Wen Wu, Shi-Jim Yen: Computational and human intelligence in blind Go. CIG 2011: 235-242 | |
| c60 | Fabien Teytaud, Olivier Teytaud: Lemmas on partial observation, with application to phantom games. CIG 2011: 243-249 | |
| c59 | Bernard Helmstetter, Chang-Shing Lee, Fabien Teytaud, Olivier Teytaud, Mei-Hui Wang, Shi-Jim Yen: Random positions in Go. CIG 2011: 250-257 | |
| c58 | Cheng-Wei Chou, Olivier Teytaud, Shi-Jim Yen: Revisiting Monte-Carlo Tree Search on a Normal Form Game: NoGo. EvoApplications (1) 2011: 73-82 | |
| c57 | Olivier Teytaud, Sébastien Flory: Upper Confidence Trees with Short Term Partial Information. EvoApplications (1) 2011: 153-162 | |
| c56 | Rémi Coulom, Philippe Rolet, Nataliya Sokolovska, Olivier Teytaud: Handling expensive optimization with large noise. FOGA 2011: 61-68 | |
| c55 | Marc Schoenauer, Fabien Teytaud, Olivier Teytaud: Simple tools for multimodal optimization. GECCO (Companion) 2011: 267-268 | |
| c54 | ||
| c53 | Nataliya Sokolovska, Olivier Teytaud, Mario Milone: Q-Learning with Double Progressive Widening: Application to Robotics. ICONIP (3) 2011: 103-112 | |
| c52 | Adrien Couëtoux, Jean-Baptiste Hoock, Nataliya Sokolovska, Olivier Teytaud, Nicolas Bonnard: Continuous Upper Confidence Trees. LION 2011: 433-445 | |
| 2010 | ||
| j13 | Anne Auger, Olivier Teytaud: Continuous Lunches Are Free Plus the Design of Optimal Optimization Algorithms. Algorithmica 57(1): 121-146 (2010) | |
| j12 | Chang-Shing Lee, Mei-Hui Wang, Olivier Teytaud, Yuan-Liang Wang: The Game of Go @ IEEE WCCI 2010 [Society Briefs]. IEEE Comp. Int. Mag. 5(4): 6-7 (2010) | |
| j11 | Jean-Baptiste Hoock, Chang-Shing Lee, Arpad Rimmel, Fabien Teytaud, Mei-Hui Wang, Olivier Teytaud: Intelligent Agents for the Game of Go. IEEE Comp. Int. Mag. 5(4): 28-42 (2010) | |
| j10 | Chang-Shing Lee, Martin Müller, Olivier Teytaud: Special Issue on Monte Carlo Techniques and Computer Go. IEEE Trans. Comput. Intellig. and AI in Games 2(4): 225-228 (2010) | |
| j9 | Arpad Rimmel, Olivier Teytaud, Chang-Shing Lee, Shi-Jim Yen, Mei-Hui Wang, Shang-Rong Tsai: Current Frontiers in Computer Go. IEEE Trans. Comput. Intellig. and AI in Games 2(4): 229-238 (2010) | |
| c51 | Amine Bourki, Guillaume Chaslot, Matthieu Coulm, Vincent Danjean, Hassen Doghmen, Jean-Baptiste Hoock, Thomas Hérault, Arpad Rimmel, Fabien Teytaud, Olivier Teytaud, Paul Vayssière, Ziqin Yut: Scalability and Parallelization of Monte-Carlo Tree Search. Computers and Games 2010: 48-58 | |
| c50 | Arpad Rimmel, Fabien Teytaud, Olivier Teytaud: Biasing Monte-Carlo Simulations through RAVE Values. Computers and Games 2010: 59-68 | |
| c49 | Romaric Gaudel, Jean-Baptiste Hoock, Julien Perez, Nataliya Sokolovska, Olivier Teytaud: A Principled Method for Exploiting Opening Books. Computers and Games 2010: 136-144 | |
| c48 | Fabien Teytaud, Olivier Teytaud: On the huge benefit of decisive moves in Monte-Carlo Tree Search algorithms. CIG 2010: 359-364 | |
| c47 | ||
| c46 | ||
| c45 | Amine Bourki, Matthieu Coulm, Philippe Rolet, Olivier Teytaud, Paul Vayssière: Parameter Tuning by Simple Regret Algorithms and Multiple Simultaneous Hypothesis Testing. ICINCO (1) 2010: 169-173 | |
| c44 | Philippe Rolet, Olivier Teytaud: Bandit-Based Estimation of Distribution Algorithms for Noisy Optimization: Rigorous Runtime Analysis. LION 2010: 97-110 | |
| c43 | Vincent Berthier, Hassen Doghmen, Olivier Teytaud: Consistency Modifications for Automatically Tuned Monte-Carlo Tree Search. LION 2010: 111-124 | |
| c42 | Philippe Rolet, Olivier Teytaud: Complexity Bounds for Batch Active Learning in Classification. ECML/PKDD (3) 2010: 293-305 | |
| c41 | Fabien Teytaud, Olivier Teytaud: Log(lambda) Modifications for Optimal Parallelism. PPSN (1) 2010: 254-263 | |
| 2009 | ||
| j8 | Guillaume Chaslot, L. Chatriot, Christophe Fiter, Sylvain Gelly, Jean-Baptiste Hoock, Julien Perez, Arpad Rimmel, Olivier Teytaud: Combiner connaissances expertes, hors-ligne, transientes et en ligne pour l'exploration Monte-Carlo. Apprentissage et MC. Revue d'Intelligence Artificielle 23(2-3): 203-220 (2009) | |
| j7 | Chang-Shing Lee, Mei-Hui Wang, Guillaume Chaslot, Jean-Baptiste Hoock, Arpad Rimmel, Olivier Teytaud, Shang-Rong Tsai, Shun-Chin Hsu, Tzung-Pei Hong: The Computational Intelligence of MoGo Revealed in Taiwan's Computer Go Tournaments. IEEE Trans. Comput. Intellig. and AI in Games 1(1): 73-89 (2009) | |
| c40 | Guillaume Chaslot, Christophe Fiter, Jean-Baptiste Hoock, Arpad Rimmel, Olivier Teytaud: Adding Expert Knowledge and Exploration in Monte-Carlo Tree Search. ACG 2009: 1-13 | |
| c39 | Fabien Teytaud, Olivier Teytaud: Creating an Upper-Confidence-Tree Program for Havannah. ACG 2009: 65-74 | |
| c38 | Guillaume Chaslot, Jean-Baptiste Hoock, Fabien Teytaud, Olivier Teytaud: On the huge benefit of quasi-random mutations for multimodal optimization with application to grid-based tuning of neurocontrollers. ESANN 2009 | |
| c37 | Nur Merve Amil, Nicolas Bredeche, Christian Gagné, Sylvain Gelly, Marc Schoenauer, Olivier Teytaud: A Statistical Learning Perspective of Genetic Programming. EuroGP 2009: 327-338 | |
| c36 | Pierre Audouard, Guillaume Chaslot, Jean-Baptiste Hoock, Julien Perez, Arpad Rimmel, Olivier Teytaud: Grid Coevolution for Adaptive Simulations: Application to the Building of Opening Books in the Game of Go. EvoWorkshops 2009: 323-332 | |
| c35 | Fabien Teytaud, Olivier Teytaud: On the Parallel Speed-Up of Estimation of Multivariate Normal Algorithm and Evolution Strategies. EvoWorkshops 2009: 655-664 | |
| c34 | Chang-Shing Lee, Mei-Hui Wang, Tzung-Pei Hong, Guillaume Chaslot, Jean-Baptiste Hoock, Arpad Rimmel, Olivier Teytaud, Yau-Hwang Kuo: A novel ontology for computer go knowledge management. FUZZ-IEEE 2009: 1056-1061 | |
| c33 | Fabien Teytaud, Olivier Teytaud: Why one must use reweighting in estimation of distribution algorithms. GECCO 2009: 453-460 | |
| c32 | François-Michel De Rainville, Christian Gagné, Olivier Teytaud, Denis Laurendeau: Optimizing low-discrepancy sequences with an evolutionary algorithm. GECCO 2009: 1491-1498 | |
| c31 | Philippe Rolet, Michèle Sebag, Olivier Teytaud: Optimal robust expensive optimization is tractable. GECCO 2009: 1951-1956 | |
| c30 | Philippe Rolet, Michèle Sebag, Olivier Teytaud: Boosting Active Learning to Optimality: A Tractable Monte-Carlo, Billiard-Based Algorithm. ECML/PKDD (2) 2009: 302-317 | |
| 2008 | ||
| c29 | Sylvain Gelly, Jean-Baptiste Hoock, Arpad Rimmel, Olivier Teytaud, Y. Kalemkarian: The Parallelization of Monte-Carlo Planning - Parallelization of MC-Planning. ICINCO-ICSO 2008: 244-249 | |
| c28 | Olivier Teytaud, Hervé Fournier: Lower Bounds for Evolution Strategies Using VC-Dimension. PPSN 2008: 102-111 | |
| c27 | ||
| 2007 | ||
| j6 | Sylvain Gelly, Sylvie Ruette, Olivier Teytaud: Comparison-Based Algorithms Are Robust and Randomized Algorithms Are Anytime. Evolutionary Computation 15(4): 411-434 (2007) | |
| j5 | Olivier Teytaud: On the Hardness of Offline Multi-objective Optimization. Evolutionary Computation 15(4): 475-491 (2007) | |
| c26 | Olivier Teytaud: Conditioning, Halting Criteria and Choosing lambda. Artificial Evolution 2007: 196-206 | |
| c25 | Olivier Teytaud, Anne Auger: On the adaptation of noise level for stochastic optimization. IEEE Congress on Evolutionary Computation 2007: 3027-3034 | |
| c24 | ||
| c23 | Olivier Teytaud, Sylvain Gelly: DCMA: yet another derandomization in covariance-matrix-adaptation. GECCO 2007: 955-963 | |
| c22 | Olivier Teytaud, Sylvain Gelly: Nonlinear programming in approximate dynamic programming - bang-bang solutions, stock-management and unsmooth penalties. ICINCO-ICSO 2007: 47-54 | |
| c21 | Olivier Teytaud, Sylvain Gelly, Jérémie Mary: Active learning in regression, with application to stochastic dynamic programming. ICINCO-ICSO 2007: 198-205 | |
| c20 | Olivier Teytaud: Slightly Beyond Turing's Computability for Studying Genetic Programming. MCU 2007: 279-290 | |
| p1 | Stéphane Lallich, Olivier Teytaud, Elie Prudhomme: Association Rule Interestingness: Measure and Statistical Validation. Quality Measures in Data Mining 2007: 251-275 | |
| 2006 | ||
| j4 | Sylvain Gelly, Olivier Teytaud: Bayesian Networks: a Non-Frequentist Approach for Parametrization, and a more Accurate Structural Complexity Measure Bayesian Networks Learning. Revue d'Intelligence Artificielle 20(6): 717-755 (2006) | |
| j3 | Sylvain Gelly, Olivier Teytaud, Nicolas Bredeche, Marc Schoenauer: Universal Consistency and Bloat in GP Some theoretical considerations about Genetic Programming from a Statistical Learning Theory viewpoint. Revue d'Intelligence Artificielle 20(6): 805-827 (2006) | |
| c19 | Sylvain Gelly, Jérémie Mary, Olivier Teytaud: Learning for stochastic dynamic programming. ESANN 2006: 191-196 | |
| c18 | ||
| c17 | Olivier Teytaud, Sylvain Gelly, Jérémie Mary: On the Ultimate Convergence Rates for Isotropic Algorithms and the Best Choices Among Various Forms of Isotropy. PPSN 2006: 32-41 | |
| i1 | Antoine Moreau, Olivier Teytaud, Jean-Pierre Bertoglio: Optimal estimation for Large-Eddy Simulation of turbulence and application to the analysis of subgrid models. CoRR abs/physics/0606053 (2006) | |
| 2005 | ||
| j2 | Frédéric Flin, Jean-Bruno Brzoska, David Coeurjolly, Romeu André Pieritz, Bernard Lesaffre, Cécile Coleou, Pascal Lamboley, Olivier Teytaud, Gérard Vignoles, Jean-François Delesse: Adaptive estimation of normals and surface area for discrete 3-D objects: application to snow binary data from X-ray tomography. IEEE Transactions on Image Processing 14(5): 585-596 (2005) | |
| c16 | Anne Auger, Mohamed Jebalia, Olivier Teytaud: Algorithms (X, sigma, eta): Quasi-random Mutations for Evolution Strategies. Artificial Evolution 2005: 296-307 | |
| c15 | Nicolas Baskiotis, Michèle Sebag, Olivier Teytaud: Systèmes inductifs-déductifs: une approche statistique. CAP 2005: 145-146 | |
| c14 | Sylvain Gelly, Olivier Teytaud: Statistical asymptotic and non-asymptotic consistency of bayesian networks: convergence to the right structure and consistent probability estimates. CAP 2005: 147-162 | |
| c13 | Sylvain Gelly, Olivier Teytaud, Nicolas Bredeche, Marc Schoenauer: Apprentissage statistique et programmation génétique: la croissance du code est-elle inévitable? CAP 2005: 163-178 | |
| c12 | Sylvain Gelly, Jérémie Mary, Olivier Teytaud: Taylor-based pseudo-metrics for random process fitting in dynamic programming: expected loss minimization and risk management. CAP 2005: 183-184 | |
| c11 | Nicolas Tarrisson, Michèle Sebag, Olivier Teytaud, Julien Lefevre, Sylvain Baillet: Multi-objective Multi-modal Optimization for Mining Spatio-temporal Patterns. CAP 2005: 217-230 | |
| c10 | Anne Auger, Marc Schoenauer, Olivier Teytaud: Local and global order 3/2 convergence of a surrogate evolutionary algorithm. GECCO 2005: 857-864 | |
| c9 | Sylvain Gelly, Olivier Teytaud, Nicolas Bredeche, Marc Schoenauer: A statistical learning theory approach of bloat. GECCO 2005: 1783-1784 | |
| c8 | Michèle Sebag, Nicolas Tarrisson, Olivier Teytaud, Julien Lefevre, Sylvain Baillet: A Multi-Objective Multi-Modal Optimization Approach for Mining Stable Spatio-Temporal Patterns. IJCAI 2005: 859-864 | |
| 2004 | ||
| c7 | Stéphane Lallich, Elie Prudhomme, Olivier Teytaud: Contrôle du risque multiple pour la sélection de règles d'association significatives. EGC 2004: 305-316 | |
| 2002 | ||
| c6 | Gérald Gavin, Olivier Teytaud: Lower Bounds for Training and Leave-One-Out Estimates of the Generalization Error. ICANN 2002: 583-588 | |
| c5 | David Coeurjolly, Frédéric Flin, Olivier Teytaud, Laure Tougne: Multigrid Convergence and Surface Area Estimation. Theoretical Foundations of Computer Vision 2002: 101-119 | |
| 2001 | ||
| j1 | Olivier Teytaud: Decidability of the halting problem for Matiyasevich deterministic machines. Theor. Comput. Sci. 257(1-2): 241-251 (2001) | |
| c4 | Radwan Jalam, Olivier Teytaud: Identification de la langue et catégorisation de textes basées sur les N-grammes. EGC 2001: 227-238 | |
| c3 | Olivier Teytaud, Hélène Paugam-Moisy: Bounds on the Generalization Ability of Bayesian Inference and Gibbs Algorithms. ICANN 2001: 265-270 | |
| c2 | ||
| 2000 | ||
| c1 | David Coeurjolly, Isabelle Debled-Rennesson, Olivier Teytaud: Segmentation and Length Estimation of 3D Discrete Curves. Digital and Image Geometry 2000: 299-317 | |
Colors in the list of coauthors
Last update Tue May 21 13:23:28 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page