SCEAS

The SCEAS System

Search the dblp DataBase

Title:
Author:

Olivier Teytaud: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

Anne Auger, Mohammed Jebalia, Olivier Teytaud
Algorithms (X, sigma, eta): Quasi-random Mutations for Evolution Strategies. [Citation Graph (0, 0)][DBLP]
Artificial Evolution, 2005, pp:296-307 [Conf]
Nicolas Baskiotis, Michèle Sebag, Olivier Teytaud
Systèmes inductifs-déductifs: une approche statistique. [Citation Graph (0, 0)][DBLP]
CAP, 2005, pp:145-146 [Conf]
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. [Citation Graph (0, 0)][DBLP]
CAP, 2005, pp:183-184 [Conf]
Sylvain Gelly, Olivier Teytaud
Statistical asymptotic and non-asymptotic consistency of bayesian networks: convergence to the right structure and consistent probability estimates. [Citation Graph (0, 0)][DBLP]
CAP, 2005, pp:147-162 [Conf]
Sylvain Gelly, Olivier Teytaud, Nicolas Bredeche, Marc Schoenauer
Apprentissage statistique et programmation génétique: la croissance du code est-elle inévitable? [Citation Graph (0, 0)][DBLP]
CAP, 2005, pp:163-178 [Conf]
Nicolas Tarrisson, Michèle Sebag, Olivier Teytaud, Julien Lefevre, Sylvain Baillet
Multi-objective Multi-modal Optimization for Mining Spatio-temporal Patterns. [Citation Graph (0, 0)][DBLP]
CAP, 2005, pp:217-230 [Conf]
David Coeurjolly, Isabelle Debled-Rennesson, Olivier Teytaud
Segmentation and Length Estimation of 3D Discrete Curves. [Citation Graph (0, 0)][DBLP]
Digital and Image Geometry, 2000, pp:299-317 [Conf]
Sylvain Gelly, Jérémie Mary, Olivier Teytaud
Learning for stochastic dynamic programming. [Citation Graph (0, 0)][DBLP]
ESANN, 2006, pp:191-196 [Conf]
Radwan Jalam, Olivier Teytaud
Identification de la langue et catégorisation de textes basées sur les N-grammes. [Citation Graph (0, 0)][DBLP]
EGC, 2001, pp:227-238 [Conf]
Stéphane Lallich, Elie Prudhomme, Olivier Teytaud
Contrôle du risque multiple pour la sélection de règles d'association significatives. [Citation Graph (0, 0)][DBLP]
EGC, 2004, pp:305-316 [Conf]
Anne Auger, Marc Schoenauer, Olivier Teytaud
Local and global order 3/2 convergence of a surrogate evolutionary algorithm. [Citation Graph (0, 0)][DBLP]
GECCO, 2005, pp:857-864 [Conf]
Sylvain Gelly, Olivier Teytaud, Nicolas Bredeche, Marc Schoenauer
A statistical learning theory approach of bloat. [Citation Graph (0, 0)][DBLP]
GECCO, 2005, pp:1783-1784 [Conf]
Gérald Gavin, Olivier Teytaud
Lower Bounds for Training and Leave-One-Out Estimates of the Generalization Error. [Citation Graph (0, 0)][DBLP]
ICANN, 2002, pp:583-588 [Conf]
Olivier Teytaud, Hélène Paugam-Moisy
Bounds on the Generalization Ability of Bayesian Inference and Gibbs Algorithms. [Citation Graph (0, 0)][DBLP]
ICANN, 2001, pp:265-270 [Conf]
Olivier Teytaud, David Sarrut
Kernel Based Image Classification. [Citation Graph (0, 0)][DBLP]
ICANN, 2001, pp:369-375 [Conf]
Michèle Sebag, Nicolas Tarrisson, Olivier Teytaud, Julien Lefevre, Sylvain Baillet
A Multi-Objective Multi-Modal Optimization Approach for Mining Stable Spatio-Temporal Patterns. [Citation Graph (0, 0)][DBLP]
IJCAI, 2005, pp:859-864 [Conf]
Olivier Teytaud, Sylvain Gelly
General Lower Bounds for Evolutionary Algorithms. [Citation Graph (0, 0)][DBLP]
PPSN, 2006, pp:21-31 [Conf]
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. [Citation Graph (0, 0)][DBLP]
PPSN, 2006, pp:32-41 [Conf]
David Coeurjolly, Frédéric Flin, Olivier Teytaud, Laure Tougne
Multigrid Convergence and Surface Area Estimation. [Citation Graph (0, 0)][DBLP]
Theoretical Foundations of Computer Vision, 2002, pp:101-119 [Conf]
Olivier Teytaud
Decidability of the halting problem for Matiyasevich deterministic machines. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2001, v:257, n:1-2, pp:241-251 [Journal]
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. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Image Processing, 2005, v:14, n:5, pp:585-596 [Journal]
Olivier Teytaud, Sylvain Gelly
DCMA: yet another derandomization in covariance-matrix-adaptation. [Citation Graph (0, 0)][DBLP]
GECCO, 2007, pp:955-963 [Conf]
Anne Auger, Olivier Teytaud
Continuous lunches are free! [Citation Graph (0, 0)][DBLP]
GECCO, 2007, pp:916-922 [Conf]
Olivier Teytaud, Sylvain Gelly
Nonlinear programming in approximate dynamic programming - bang-bang solutions, stock-management and unsmooth penalties. [Citation Graph (0, 0)][DBLP]
ICINCO-ICSO, 2007, pp:47-54 [Conf]
Olivier Teytaud, Sylvain Gelly, Jérémie Mary
Active learning in regression, with application to stochastic dynamic programming. [Citation Graph (0, 0)][DBLP]
ICINCO-ICSO, 2007, pp:198-205 [Conf]
Olivier Teytaud
Slightly Beyond Turing's Computability for Studying Genetic Programming. [Citation Graph (0, 0)][DBLP]
MCU, 2007, pp:279-290 [Conf]
Antoine Moreau, Olivier Teytaud, Jean-Pierre Bertoglio
Optimal estimation for Large-Eddy Simulation of turbulence and application to the analysis of subgrid models [Citation Graph (0, 0)][DBLP]
CoRR, 2006, v:0, n:, pp:- [Journal]
Creating an Upper-Confidence-Tree Program for Havannah. [Citation Graph (, )][DBLP]
Adding Expert Knowledge and Exploration in Monte-Carlo Tree Search. [Citation Graph (, )][DBLP]
Conditioning, Halting Criteria and Choosing lambda. [Citation Graph (, )][DBLP]
A Statistical Learning Perspective of Genetic Programming. [Citation Graph (, )][DBLP]
Bandit-Based Genetic Programming. [Citation Graph (, )][DBLP]
Grid Coevolution for Adaptive Simulations: Application to the Building of Opening Books in the Game of Go. [Citation Graph (, )][DBLP]
On the Parallel Speed-Up of Estimation of Multivariate Normal Algorithm and Evolution Strategies. [Citation Graph (, )][DBLP]
Adaptive Noisy Optimization. [Citation Graph (, )][DBLP]
Why one must use reweighting in estimation of distribution algorithms. [Citation Graph (, )][DBLP]
Optimizing low-discrepancy sequences with an evolutionary algorithm. [Citation Graph (, )][DBLP]
Optimal robust expensive optimization is tractable. [Citation Graph (, )][DBLP]
The Parallelization of Monte-Carlo Planning - Parallelization of MC-Planning. [Citation Graph (, )][DBLP]
Boosting Active Learning to Optimality: A Tractable Monte-Carlo, Billiard-Based Algorithm. [Citation Graph (, )][DBLP]
Complexity Bounds for Batch Active Learning in Classification. [Citation Graph (, )][DBLP]
Lower Bounds for Evolution Strategies Using VC-Dimension. [Citation Graph (, )][DBLP]
When Does Quasi-random Work?. [Citation Graph (, )][DBLP]
Log(lambda) Modifications for Optimal Parallelism. [Citation Graph (, )][DBLP]
On the adaptation of noise level for stochastic optimization. [Citation Graph (, )][DBLP]
Consistency Modifications for Automatically Tuned Monte-Carlo Tree Search. [Citation Graph (, )][DBLP]
Bandit-Based Estimation of Distribution Algorithms for Noisy Optimization: Rigorous Runtime Analysis. [Citation Graph (, )][DBLP]
Continuous Lunches Are Free Plus the Design of Optimal Optimization Algorithms. [Citation Graph (, )][DBLP]
Comparison-Based Algorithms Are Robust and Randomized Algorithms Are Anytime. [Citation Graph (, )][DBLP]
On the Hardness of Offline Multi-objective Optimization. [Citation Graph (, )][DBLP]

Search in 0.003secs, Finished in 0.457secs

NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP