- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j12 |      | Tristan Cazenave: Monte-Carlo Expression Discovery. International Journal on Artificial Intelligence Tools 22(1) (2013) |
| 2012 | ||
| j11 | | Abdallah Saffidine, Tristan Cazenave, Jean Méhat: UCD : Upper confidence bound for rooted directed acyclic graphs. Knowl.-Based Syst. 34: 26-33 (2012) |
| j10 | | Tristan Cazenave: Monte Carlo Beam Search. IEEE Trans. Comput. Intellig. and AI in Games 4(1): 68-72 (2012) |
| c30 | | |
| c29 | | Tristan Cazenave, Fabien Teytaud: Application of the Nested Rollout Policy Adaptation Algorithm to the Traveling Salesman Problem with Time Windows. LION 2012: 42-54 |
| 2011 | ||
| j9 | | |
| c28 | | Abdallah Saffidine, Nicolas Jouandeau, Tristan Cazenave: Solving breakthrough with Race Patterns and Job-Level Proof Number Search. ACG 2011: 196-207 |
| c27 | | Arpad Rimmel, Fabien Teytaud, Tristan Cazenave: Optimization of the Nested Monte-Carlo Algorithm on the Traveling Salesman Problem with Time Windows. EvoApplications (2) 2011: 501-510 |
| 2010 | ||
| j8 | | Jean Méhat, Tristan Cazenave: Combining UCT and Nested Monte Carlo Search for Single-Player General Game Playing. IEEE Trans. Comput. Intellig. and AI in Games 2(4): 271-277 (2010) |
| c26 | | Tristan Cazenave, Abdallah Saffidine: Score Bounded Monte-Carlo Tree Search. Computers and Games 2010: 93-104 |
| c25 | | Marc Csernel, Tristan Cazenave: Comparing Sanskrit Texts for Critical Editions. COLING (Posters) 2010: 206-213 |
| c24 | | |
| c23 | | |
| 2009 | ||
| j7 | | Tristan Cazenave, Abdallah Saffidine: Utilisation de la recherche arborescente Monte-Carlo au Hex. Revue d'Intelligence Artificielle 23(2-3): 183-202 (2009) |
| c22 | | |
| c21 | | |
| c20 | | |
| 2008 | ||
| c19 | | |
| c18 | | Tristan Cazenave, Nicolas Jouandeau: A Parallel Monte-Carlo Tree Search Algorithm. Computers and Games 2008: 72-80 |
| 2007 | ||
| j6 |  | |
| c17 | | |
| 2006 | ||
| c16 | | |
| c15 | | |
| c14 | | Tristan Cazenave: Optimizations of data structures, heuristics and algorithms for path-finding on maps. CIG 2006: 27-33 |
| 2005 | ||
| j5 | | Tristan Cazenave, Bernard Helmstetter: Search for transitive connections. Inf. Sci. 175(4): 284-295 (2005) |
| c13 | | Tristan Cazenave, Bernard Helmstetter: Combining Tactical Search and Monte-Carlo in the Game of Go. CIG 2005 |
| 2004 | ||
| c12 | | Bernard Helmstetter, Tristan Cazenave: Incremental Transpositions. Computers and Games 2004: 220-231 |
| c11 | | |
| 2003 | ||
| j4 | | |
| c10 | | |
| c9 | | Bernard Helmstetter, Tristan Cazenave: Searching with Analysis of Dependencies in a Solitaire Card Game. ACG 2003: 343-360 |
| 2002 | ||
| j3 | | |
| c8 | | |
| c7 | | |
| c6 | | |
| 2001 | ||
| j2 | | Bruno Bouzy, Tristan Cazenave: Computer Go: An AI oriented survey. Artif. Intell. 132(1): 39-103 (2001) |
| c5 | | |
| 2000 | ||
| c4 | | |
| 1999 | ||
| c3 | | |
| 1998 | ||
| j1 | | Tristan Cazenave: Synthesis of an Efficient Tactical Theorem Prover for the Game of Go. ACM Comput. Surv. 30(3es): 18 (1998) |
| c2 | | |
| c1 | | |
| 1 | Bruno Bouzy | |
| 2 | Marc Csernel | |
| 3 | Bernard Helmstetter | |
| 4 | Nicolas Jouandeau | |
| 5 | Jean Méhat | |
| 6 | Arpad Rimmel | |
| 7 | Abdallah Saffidine | |
| 8 | Fabien Teytaud | |
| 9 | R. Vilà |
Colors in the list of coauthors
Last update Sun May 19 22:52:34 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page