Florian Richoux

Orcid: 0000-0003-4693-379X

According to our database1, Florian Richoux authored at least 27 papers between 2009 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Multiagent Systems on Virtual Games: A Systematic Mapping Study.
IEEE Trans. Games, June, 2023

Learning qubo Models for Quantum Annealing: A Constraint-Based Approach.
Proceedings of the Computational Science - ICCS 2023, 2023

2022
Terrain Analysis in StarCraft 1 and 2 as Combinatorial Optimization.
Proceedings of the IEEE Congress on Evolutionary Computation, 2022

2021
Error function learning with interpretable compositional networks for constraint-based local search.
Proceedings of the GECCO '21: Genetic and Evolutionary Computation Conference, 2021

Interpretable Utility-based Models Applied to the FightingICE Platform.
Proceedings of the 2021 IEEE Conference on Games (CoG), 2021

2020
Resilient Team Formation with Stabilisability of Agent Networks for Task Allocation.
ACM Trans. Auton. Adapt. Syst., 2020

Automatic Cost Function Learning with Interpretable Compositional Networks.
CoRR, 2020

microPhantom: Playing microRTS under uncertainty and chaos.
Proceedings of the IEEE Conference on Games, 2020

2019
RTS AI Problems and Techniques.
Proceedings of the Encyclopedia of Computer Graphics and Games., 2019

StarCraft Bots and Competitions.
Proceedings of the Encyclopedia of Computer Graphics and Games., 2019

Comparing two deep learning sequence-based models for protein-protein interaction prediction.
CoRR, 2019

Constrained optimization under uncertainty for decision-making problems: Application to Real-Time Strategy games.
Proceedings of the IEEE Congress on Evolutionary Computation, 2019

2017
Introduction.
Rev. d'Intelligence Artif., 2017

2016
ghost: A Combinatorial Optimization Framework for Real-Time Problems.
IEEE Trans. Comput. Intell. AI Games, 2016

Estimating parallel runtimes for randomized algorithms in constraint solving.
J. Heuristics, 2016

TorchCraft: a Library for Machine Learning Research on Real-Time Strategy Games.
CoRR, 2016

2015
Large-scale parallelism for constraint-based local search: the costas array case study.
Constraints An Int. J., 2015

2014
Walling in Strategy Games via Constraint Optimization.
Proceedings of the Tenth AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, 2014

2013
A Survey of Real-Time Strategy Game AI Research and Competition in StarCraft.
IEEE Trans. Comput. Intell. AI Games, 2013

Complexity of existential positive first-order logic.
J. Log. Comput., 2013

Prediction of Parallel Speed-Ups for Las Vegas Algorithms.
Proceedings of the 42nd International Conference on Parallel Processing, 2013

2012
Performance analysis of parallel constraint-based local search.
Proceedings of the 17th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2012

Constraint-Based Local Search for the Costas Array Problem.
Proceedings of the Learning and Intelligent Optimization - 6th International Conference, 2012

Parallel Local Search for the Costas Array Problem.
Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium Workshops & PhD Forum, 2012

2010
Complexity of Homogeneous Co-Boolean Constraint Satisfaction Problems
CoRR, 2010

2009
Toward a complexity classification of CSP through kernel width.
PhD thesis, 2009

On the Computational Complexity of Monotone Constraint Satisfaction Problems.
Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009


  Loading...