 | 2012 |
| 37 |  | Tristan Cazenave:
Monte Carlo Beam Search.
IEEE Trans. Comput. Intellig. and AI in Games 4(1): 68-72 (2012) |
| 2011 |
| 36 |  | 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 |
| 35 |  | Jean Méhat,
Tristan Cazenave:
A Parallel General Game Player.
KI 25(1): 43-47 (2011) |
| 2010 |
| 34 |  | Marc Csernel,
Tristan Cazenave:
Comparing Sanskrit Texts for Critical Editions.
COLING (Posters) 2010: 206-213 |
| 33 |  | Tristan Cazenave,
Abdallah Saffidine:
Score Bounded Monte-Carlo Tree Search.
Computers and Games 2010: 93-104 |
| 32 |  | Tristan Cazenave:
Nested Monte-Carlo Expression Discovery.
ECAI 2010: 1057-1058 |
| 31 |  | Tristan Cazenave:
Partial Move A*.
ICTAI (2) 2010: 25-31 |
| 30 |  | 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) |
| 2009 |
| 29 |  | Tristan Cazenave:
Monte-Carlo Kakuro.
ACG 2009: 45-54 |
| 28 |  | Tristan Cazenave:
Nested Monte-Carlo Search.
IJCAI 2009: 456-461 |
| 27 |  | Tristan Cazenave,
Nicolas Jouandeau:
Parallel Nested Monte-Carlo search.
IPDPS 2009: 1-6 |
| 26 |  | Tristan Cazenave,
Abdallah Saffidine:
Utilisation de la recherche arborescente Monte-Carlo au Hex.
Revue d'Intelligence Artificielle 23(2-3): 183-202 (2009) |
| 2008 |
| 25 |  | Tristan Cazenave:
Multi-player Go.
Computers and Games 2008: 50-59 |
| 24 |  | Tristan Cazenave,
Nicolas Jouandeau:
A Parallel Monte-Carlo Tree Search Algorithm.
Computers and Games 2008: 72-80 |
| 2007 |
| 23 |  | Tristan Cazenave:
Overestimation for Multiple Sequence Alignment.
CIBCB 2007: 159-164 |
| 22 |  | Tristan Cazenave:
Playing the Right Atari.
ICGA Journal 30(1): 35-42 (2007) |
| 2006 |
| 21 |  | Tristan Cazenave:
A Phantom-Go Program.
ACG 2006: 120-125 |
| 20 |  | Tristan Cazenave:
Optimizations of data structures, heuristics and algorithms for path-finding on maps.
CIG 2006: 27-33 |
| 19 |  | Tristan Cazenave:
Virtual Global Search: Application to 9×9 Go.
Computers and Games 2006: 62-71 |
| 2005 |
| 18 |  | Tristan Cazenave,
Bernard Helmstetter:
Combining Tactical Search and Monte-Carlo in the Game of Go.
CIG 2005 |
| 17 |  | Tristan Cazenave,
Bernard Helmstetter:
Search for transitive connections.
Inf. Sci. 175(4): 284-295 (2005) |
| 2004 |
| 16 |  | Bernard Helmstetter,
Tristan Cazenave:
Incremental Transpositions.
Computers and Games 2004: 220-231 |
| 15 |  | Tristan Cazenave:
Generalized Widening.
ECAI 2004: 156-160 |
| 2003 |
| 14 |  | R. Vilà,
Tristan Cazenave:
When One Eye is Sufficient: A Static Classification.
ACG 2003: 109-124 |
| 13 |  | Bernard Helmstetter,
Tristan Cazenave:
Searching with Analysis of Dependencies in a Solitaire Card Game.
ACG 2003: 343-360 |
| 12 |  | Tristan Cazenave:
Metarules to improve tactical Go knowledge.
Inf. Sci. 154(3-4): 173-188 (2003) |
| 2002 |
| 11 |  | Tristan Cazenave:
A Generalized Threats Search Algorithm.
Computers and Games 2002: 75-87 |
| 10 |  | Tristan Cazenave:
Metarules to Improve Tactical Go Knowledge.
JCIS 2002: 465-468 |
| 9 |  | Tristan Cazenave:
Admissible Moves in Two-Player Games.
SARA 2002: 52-63 |
| 8 |  | Tristan Cazenave:
Gradual Abstract Proof Search.
ICGA Journal 25(1): 3-15 (2002) |
| 2001 |
| 7 |  | Tristan Cazenave:
Iterative Widening.
IJCAI 2001: 523-528 |
| 6 |  | Bruno Bouzy,
Tristan Cazenave:
Computer Go: An AI oriented survey.
Artif. Intell. 132(1): 39-103 (2001) |
| 2000 |
| 5 |  | Tristan Cazenave:
Abstract Proof Search.
Computers and Games 2000: 39-54 |
| 1999 |
| 4 |  | Tristan Cazenave:
Metaprogramming Domain Specific Metaprograms.
Reflection 1999: 235-249 |
| 1998 |
| 3 |  | Tristan Cazenave:
Metaprogramming Forced Moves.
ECAI 1998: 645-649 |
| 2 |  | Tristan Cazenave:
Strategic Evaluation in Complex Domains.
FLAIRS Conference 1998: 2-6 |
| 1 |  | Tristan Cazenave:
Synthesis of an Efficient Tactical Theorem Prover for the Game of Go.
ACM Comput. Surv. 30(3es): 18 (1998) |