Tristan Cazenave
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Tristan Cazenave has a total of 91 co-authors. Here are the top co-authors by number of shared publications:
- Abdallah Saffidine
Potassco Solutions Potsdam Germany
4 shared publications - Jérôme Arjonilla
PSL University - Dauphine, Paris, France
4 shared publications - Mark H. M. Winands
Maastricht University
4 shared publications - Milo Roucairol
Universite Paris Dauphine - PSL
4 shared publications Abdallah Saffidine
The University of New South Wales
3 shared publicationsChristophe Guettier
Safran Electronics and Defense
3 shared publications
Latest Publications
- Open Access
- 13 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 226-233
L0 Feature Selection via Monte Carlo Tree Search in High-Dimensional Financial Regression
- 13 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 226-233
Open AccessL0 Feature Selection via Monte Carlo Tree Search in High-Dimensional Financial Regression
- 2 July 2026
- Published by Springer Nature
- p. 16-27
Refutation of Spectral Graph Theory Conjectures with Search Algorithms
- 2 July 2026
- Published by Springer Nature
- p. 16-27
Refutation of Spectral Graph Theory Conjectures with Search Algorithms
- 11 June 2026
- Published by SAGE Publications in ICGA Journal: The Journal of the Computer Games Community
- Vol. 48 (2) , 77-80
The 2025 Computer Olympiad: Athénan Wins 9 Gold Medals
- 11 June 2026
- Published by SAGE Publications in ICGA Journal: The Journal of the Computer Games Community
- Vol. 48 (2) , 77-80
The 2025 Computer Olympiad: Athénan Wins 9 Gold Medals
- 1 May 2026
- Published by SAGE Publications in ICGA Journal: The Journal of the Computer Games Community
- Vol. 48 (2) , 38-61
Optimized Kernels in MobileNet Architectures for Computer Chess
This work investigates the use of various Residual and MobileNet architectures within the Leela Chess Zero (Lc0) engine. In particular, it examines convolutional layers using specific kernels inspired by chess piece movement patterns. The most effective configuration, combining knight, rook, and bishop filters, is further optimized at a low implementation level to speed up network inference during move search. All network variants are trained on the recent T80 dataset, consisting of self-played games generated by Lc0. Their relative performance is then evaluated through a series of tournaments conducted under different time controls, including bullet, blitz, and rapid formats.
- 1 May 2026
- Published by SAGE Publications in ICGA Journal: The Journal of the Computer Games Community
- Vol. 48 (2) , 38-61
Optimized Kernels in MobileNet Architectures for Computer Chess
This work investigates the use of various Residual and MobileNet architectures within the Leela Chess Zero (Lc0) engine. In particular, it examines convolutional layers using specific kernels inspired by chess piece movement patterns. The most effective configuration, combining knight, rook, and bishop filters, is further optimized at a low implementation level to speed up network inference during move search. All network variants are trained on the recent T80 dataset, consisting of self-played games generated by Lc0. Their relative performance is then evaluated through a series of tournaments conducted under different time controls, including bullet, blitz, and rapid formats.
- 1 May 2026
- Published by SAGE Publications in ICGA Journal: The Journal of the Computer Games Community
- Vol. 48 (2) , 62-76
Generation and Evaluation of Exploration Terms for Monte Carlo Tree Search
Monte Carlo Tree Search (MCTS) has shown good results for many difficult problems. We propose to automatically generate mathematical expressions that are used as exploration terms for MCTS algorithms, and we evaluate the resulting expressions in the game of Go. We use a systematic generation of small exploration terms. This is in contrast to our initial conference paper, which used Monte Carlo Search to generate exploration terms for Sequential Halving Using Scores (SHUSS). In this journal paper, we extend the work to automatically design three exploration terms: the exploration term near the leaves of Prior Upper Confidence for Trees (PUCT), the exploration term at the root of PUCT and the SHUSS exploration term. All three resulting exploration terms improve upon standard PUCT in the game of Go.
- 1 May 2026
- Published by SAGE Publications in ICGA Journal: The Journal of the Computer Games Community
- Vol. 48 (2) , 62-76
Generation and Evaluation of Exploration Terms for Monte Carlo Tree Search
Monte Carlo Tree Search (MCTS) has shown good results for many difficult problems. We propose to automatically generate mathematical expressions that are used as exploration terms for MCTS algorithms, and we evaluate the resulting expressions in the game of Go. We use a systematic generation of small exploration terms. This is in contrast to our initial conference paper, which used Monte Carlo Search to generate exploration terms for Sequential Halving Using Scores (SHUSS). In this journal paper, we extend the work to automatically design three exploration terms: the exploration term near the leaves of Prior Upper Confidence for Trees (PUCT), the exploration term at the root of PUCT and the SHUSS exploration term. All three resulting exploration terms improve upon standard PUCT in the game of Go.
- 2 January 2026
- Published by Springer Nature
- p. 142-156
Adaptive Bias Generalized Rollout Policy Adaptation on the Flexible Job-Shop Scheduling Problem
- 2 January 2026
- Published by Springer Nature
- p. 142-156
Adaptive Bias Generalized Rollout Policy Adaptation on the Flexible Job-Shop Scheduling Problem
- 2 January 2026
- Published by Springer Nature
- p. 281-297
SchedulExpert: Graph Attention Meets Mixture-of-Experts for JSSP
- 2 January 2026
- Published by Springer Nature
- p. 281-297
SchedulExpert: Graph Attention Meets Mixture-of-Experts for JSSP
- 2 January 2026
- Published by Springer Nature
- p. 52-63
Automated Refutation with Monte Carlo Search of Graph Theory Conjectures on the Maximum Laplacian Eigenvalue
- 2 January 2026
- Published by Springer Nature
- p. 52-63
Automated Refutation with Monte Carlo Search of Graph Theory Conjectures on the Maximum Laplacian Eigenvalue
- Open Access
BeeRNA: tertiary structure-based RNA inverse folding using Artificial Bee Colony
The Ribonucleic Acid (RNA) inverse folding problem, designing nucleotide sequences that fold into specific tertiary structures, is a fundamental computational biology problem with important applications in synthetic biology and bioengineering. The design of complex three-dimensional RNA architectures remains computationally demanding and mostly unresolved, as most existing approaches focus on secondary structures. In order to address tertiary RNA inverse folding, we present BeeRNA, a bio-inspired method that employs the Artificial Bee Colony (ABC) optimization algorithm. Our approach combines base-pair distance filtering with RMSD-based structural assessment using RhoFold for structure prediction, resulting in a two-stage fitness evaluation strategy. To guarantee biologically plausible sequences with balanced GC content, the algorithm takes thermodynamic constraints and adaptive mutation rates into consideration. In this work, we focus primarily on short and medium-length RNAs ($<$ 100 nucleotides), a biologically significant regime that includes microRNAs (miRNAs), aptamers, and ribozymes, where BeeRNA achieves high structural fidelity with practical CPU runtimes. The lightweight, training-free implementation will be publicly released for reproducibility, offering a promising bio-inspired approach for RNA design in therapeutics and biotechnology.
Open AccessBeeRNA: tertiary structure-based RNA inverse folding using Artificial Bee Colony
The Ribonucleic Acid (RNA) inverse folding problem, designing nucleotide sequences that fold into specific tertiary structures, is a fundamental computational biology problem with important applications in synthetic biology and bioengineering. The design of complex three-dimensional RNA architectures remains computationally demanding and mostly unresolved, as most existing approaches focus on secondary structures. In order to address tertiary RNA inverse folding, we present BeeRNA, a bio-inspired method that employs the Artificial Bee Colony (ABC) optimization algorithm. Our approach combines base-pair distance filtering with RMSD-based structural assessment using RhoFold for structure prediction, resulting in a two-stage fitness evaluation strategy. To guarantee biologically plausible sequences with balanced GC content, the algorithm takes thermodynamic constraints and adaptive mutation rates into consideration. In this work, we focus primarily on short and medium-length RNAs ($<$ 100 nucleotides), a biologically significant regime that includes microRNAs (miRNAs), aptamers, and ribozymes, where BeeRNA achieves high structural fidelity with practical CPU runtimes. The lightweight, training-free implementation will be publicly released for reproducibility, offering a promising bio-inspired approach for RNA design in therapeutics and biotechnology.