Nested Monte-Carlo expression discovery

Frontiers in Artificial Intelligence and Applications

Volumn 215, Issue , 2010, Pages 1057-1058

  Cazenave, Tristan ^a  

^a Centre National de la Recherche Scientifique   (France)

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY; GENETIC ALGORITHMS; MONTE CARLO METHODS;

BENCHMARK PROBLEMS; EVALUATION FUNCTION; LOCAL OPTIMA; NESTED MONTE-CARLO; RESTART STRATEGY; SIMPLE++; STATE OF THE ART;

GENETIC PROGRAMMING;

EID: 77956049149     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: 10.3233/978-1-60750-606-5-1057     Document Type: Conference Paper

References (7)

1. Tristan Cazenave, 'Nested Monte-Carlo search', in IJCAI, pp. 456-461, (2009).
2. R. Coulom, 'Efficient selectivity and back-up operators in monte-carlo tree search', in Computers and Games 2006, Volume 4630 of LNCS, pp. 72-83, Torino, Italy, (2006). Springer.
3. Hilmar Finnsson and Yngvi Björnsson, 'Simulation-based approach to general game playing', in AAAI, pp. 259-264, (2008).
4. Sylvain Gelly and David Silver, 'Achieving master level play in 9 x 9 computer go', in AAAI, pp. 1537-1540, (2008).
5. J. R. Koza, Genetic Programming: On the Programming of Computers by Means of Natural Selection., MIT Press, Cambridge, MA, 1992.
6. Lee Spector, David M. Clark, Ian Lindsay, Bradford Barr, and Jon Klein, 'Genetic programming for finite algebras', in Genetic And Evolutionary Computation Conference, pp. 1291-1298. ACM New York, NY, USA, (2008).
7. James Alfred Walker and Julian Francis Miller, 'Predicting prime numbers using cartesian genetic programming', in Genetic Programming, Volume 4445 of LNCS, pp. 205-216. Springer, (2007).