Difference between revisions of "Michèle Sebag"

From Chessprogramming wiki
Jump to: navigation, search
Line 23: Line 23:
 
* [[Romaric Gaudel]], [[Michèle Sebag]] ('''2010'''). ''Feature Selection as a one-player game''. [http://www.icml2010.org/ ICML 2010], [http://www.icml2010.org/papers/247.pdf pdf]
 
* [[Romaric Gaudel]], [[Michèle Sebag]] ('''2010'''). ''Feature Selection as a one-player game''. [http://www.icml2010.org/ ICML 2010], [http://www.icml2010.org/papers/247.pdf pdf]
 
* [[Sylvain Gelly]], [[Marc Schoenauer]], [[Michèle Sebag]], [[Olivier Teytaud]], [[Levente Kocsis]], [[David Silver]], [[Csaba Szepesvári]] ('''2012'''). ''[http://dl.acm.org/citation.cfm?id=2093548.2093574 The Grand Challenge of Computer Go: Monte Carlo Tree Search and Extensions]''. [[ACM#Communications|Communications of the ACM]], Vol. 55, No. 3, [http://www0.cs.ucl.ac.uk/staff/D.Silver/web/Applications_files/grand-challenge.pdf pdf preprint]
 
* [[Sylvain Gelly]], [[Marc Schoenauer]], [[Michèle Sebag]], [[Olivier Teytaud]], [[Levente Kocsis]], [[David Silver]], [[Csaba Szepesvári]] ('''2012'''). ''[http://dl.acm.org/citation.cfm?id=2093548.2093574 The Grand Challenge of Computer Go: Monte Carlo Tree Search and Extensions]''. [[ACM#Communications|Communications of the ACM]], Vol. 55, No. 3, [http://www0.cs.ucl.ac.uk/staff/D.Silver/web/Applications_files/grand-challenge.pdf pdf preprint]
* [[Ilya Loshchilov]], [[Marc Schoenauer]], [[Michèle Sebag]] ('''2012'''). ''Alternative Restart Strategies for CMA-ES''. [https://arxiv.org/abs/1207.0206 arXiv:1207.0206] <ref>[https://en.wikipedia.org/wiki/CMA-ES CMA-ES from Wikipedia]</ref>
+
* [[Ilya Loshchilov]], [[Marc Schoenauer]], [[Michèle Sebag]] ('''2012'''). ''Self-Adaptive Surrogate-Assisted Covariance Matrix Adaptation Evolution Strategy''. [https://arxiv.org/abs/1204.2356 arXiv:1204.2356] <ref>[https://en.wikipedia.org/wiki/CMA-ES CMA-ES from Wikipedia]</ref>
 +
* [[Ilya Loshchilov]], [[Marc Schoenauer]], [[Michèle Sebag]] ('''2012'''). ''Alternative Restart Strategies for CMA-ES''. [https://arxiv.org/abs/1207.0206 arXiv:1207.0206]
 
* [[Thomas Philip Runarsson]], [[Marc Schoenauer]], [[Michèle Sebag]] ('''2012'''). ''Pilot, Rollout and Monte Carlo Tree Search Methods for Job Shop Scheduling''. [https://arxiv.org/abs/1210.0374 arXiv:1210.0374]
 
* [[Thomas Philip Runarsson]], [[Marc Schoenauer]], [[Michèle Sebag]] ('''2012'''). ''Pilot, Rollout and Monte Carlo Tree Search Methods for Job Shop Scheduling''. [https://arxiv.org/abs/1210.0374 arXiv:1210.0374]
 
* [[Ilya Loshchilov]], [[Marc Schoenauer]], [[Michèle Sebag]] ('''2013'''). ''KL-based Control of the Learning Schedule for Surrogate Black-Box Optimization''. [https://arxiv.org/abs/1308.2655 arXiv:1308.2655]
 
* [[Ilya Loshchilov]], [[Marc Schoenauer]], [[Michèle Sebag]] ('''2013'''). ''KL-based Control of the Learning Schedule for Surrogate Black-Box Optimization''. [https://arxiv.org/abs/1308.2655 arXiv:1308.2655]

Revision as of 10:00, 13 September 2019

Home * People * Michèle Sebag

Michèle Sebag [1]

Michèle Sebag,
a French mathematician and computer scientist, head of Laboratoire de Recherche en Informatique, LRI, French National Centre for Scientific Research, CNRS, Paris-Sud 11 University, and along with Marc Schoenauer head the TAO Project Team [2], National Institute for Research in Computer Science and Control, INRIA, Saclay, Île-de-France. Her research interests include the broad range of artificial intelligence, machine learning, knowledge discovery, stochastic optimization and genetic programming [3].

Selected Publications

[4] [5] [6]

1990 ...

2000 ...

Jérôme Maloberti, Michèle Sebag (2001). θ-Subsumption in a Constraint Satisfaction Perspective. ILP 2001

2010 ...

External Links

References

Up one level