default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFlorian Richoux
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i10]Florian Richoux:
Injecting Combinatorial Optimization into MCTS: Application to the Board Game boop. CoRR abs/2406.08766 (2024)- 2023
- [j8]Jose Barambones
, Juan Cano-Benito, Ismael Sánchez-Rivero, Ricardo Imbert, Florian Richoux:
Multiagent Systems on Virtual Games: A Systematic Mapping Study. IEEE Trans. Games 15(2): 134-147 (2023) - [c13]Florian Richoux, Jean-François Baffier, Philippe Codognet:
Learning qubo Models for Quantum Annealing: A Constraint-Based Approach. ICCS (5) 2023: 153-167 - 2022
- [c12]Florian Richoux:
Terrain Analysis in StarCraft 1 and 2 as Combinatorial Optimization. CEC 2022: 1-8 - [i9]Florian Richoux:
Terrain Analysis in StarCraft 1 and 2 as Combinatorial Optimization. CoRR abs/2205.08683 (2022) - 2021
- [c11]Tianyu Chen, Florian Richoux, Javier M. Torres, Katsumi Inoue:
Interpretable Utility-based Models Applied to the FightingICE Platform. CoG 2021: 1-8 - [c10]Florian Richoux, Jean-François Baffier:
Error function learning with interpretable compositional networks for constraint-based local search. GECCO Companion 2021: 137-138 - 2020
- [j7]Jose Barambones, Florian Richoux, Ricardo Imbert, Katsumi Inoue:
Resilient Team Formation with Stabilisability of Agent Networks for Task Allocation. ACM Trans. Auton. Adapt. Syst. 15(3): 7:1-7:24 (2020) - [c9]Florian Richoux:
microPhantom: Playing microRTS under uncertainty and chaos. CoG 2020: 670-677 - [i8]Florian Richoux, Jean-François Baffier:
Automatic Cost Function Learning with Interpretable Compositional Networks. CoRR abs/2002.09811 (2020) - [i7]Florian Richoux:
microPhantom: Playing microRTS under uncertainty and chaos. CoRR abs/2005.11019 (2020)
2010 – 2019
- 2019
- [c8]Valentin Antuori, Florian Richoux:
Constrained optimization under uncertainty for decision-making problems: Application to Real-Time Strategy games. CEC 2019: 458-465 - [r2]David Churchill, Mike Preuss, Florian Richoux, Gabriel Synnaeve, Alberto Uriarte, Santiago Ontañón, Michal Certický:
StarCraft Bots and Competitions. Encyclopedia of Computer Graphics and Games 2019 - [r1]Santiago Ontañón, Gabriel Synnaeve, Alberto Uriarte, Florian Richoux, David Churchill, Mike Preuss:
RTS AI Problems and Techniques. Encyclopedia of Computer Graphics and Games 2019 - [i6]Valentin Antuori, Florian Richoux:
Constrained optimization under uncertainty for decision-making problems: Application to Real-Time Strategy games. CoRR abs/1901.00942 (2019) - [i5]Florian Richoux, Charlène Servantie, Cynthia Borès, Stéphane Téletchéa:
Comparing two deep learning sequence-based models for protein-protein interaction prediction. CoRR abs/1901.06268 (2019) - 2017
- [j6]Carole Adam, Cédric Buche, Tristan Cazenave, Florian Richoux:
Introduction. Rev. d'Intelligence Artif. 31(3): 247-248 (2017) - 2016
- [j5]Charlotte Truchet, Alejandro Arbelaez, Florian Richoux, Philippe Codognet:
Estimating parallel runtimes for randomized algorithms in constraint solving. J. Heuristics 22(4): 613-648 (2016) - [j4]Florian Richoux, Alberto Uriarte, Jean-François Baffier:
ghost: A Combinatorial Optimization Framework for Real-Time Problems. IEEE Trans. Comput. Intell. AI Games 8(4): 377-388 (2016) - [i4]Gabriel Synnaeve, Nantas Nardelli, Alex Auvolat, Soumith Chintala, Timothée Lacroix, Zeming Lin, Florian Richoux, Nicolas Usunier:
TorchCraft: a Library for Machine Learning Research on Real-Time Strategy Games. CoRR abs/1611.00625 (2016) - 2015
- [j3]Yves Caniou, Philippe Codognet, Florian Richoux, Daniel Diaz, Salvador Abreu:
Large-scale parallelism for constraint-based local search: the costas array case study. Constraints An Int. J. 20(1): 30-56 (2015) - 2014
- [c7]Florian Richoux, Alberto Uriarte, Santiago Ontañón:
Walling in Strategy Games via Constraint Optimization. AIIDE 2014 - 2013
- [j2]Manuel Bodirsky, Miki Hermann, Florian Richoux:
Complexity of existential positive first-order logic. J. Log. Comput. 23(4): 753-760 (2013) - [j1]Santiago Ontañón, Gabriel Synnaeve, Alberto Uriarte, Florian Richoux, David Churchill, Mike Preuss:
A Survey of Real-Time Strategy Game AI Research and Competition in StarCraft. IEEE Trans. Comput. Intell. AI Games 5(4): 293-311 (2013) - [c6]Charlotte Truchet, Florian Richoux, Philippe Codognet:
Prediction of Parallel Speed-Ups for Las Vegas Algorithms. ICPP 2013: 160-169 - 2012
- [c5]Daniel Diaz, Florian Richoux, Yves Caniou, Philippe Codognet, Salvador Abreu:
Parallel Local Search for the Costas Array Problem. IPDPS Workshops 2012: 1793-1802 - [c4]Daniel Diaz, Florian Richoux, Philippe Codognet, Yves Caniou, Salvador Abreu:
Constraint-Based Local Search for the Costas Array Problem. LION 2012: 378-383 - [c3]Yves Caniou, Daniel Diaz, Florian Richoux, Philippe Codognet, Salvador Abreu:
Performance analysis of parallel constraint-based local search. PPoPP 2012: 337-338 - [i3]Charlotte Truchet, Florian Richoux, Philippe Codognet:
Prediction of Parallel Speed-ups for Las Vegas Algorithms. CoRR abs/1212.4287 (2012) - 2010
- [i2]Florian Richoux:
Complexity of Homogeneous Co-Boolean Constraint Satisfaction Problems. CoRR abs/1011.4744 (2010) - [i1]Manuel Bodirsky, Miki Hermann, Florian Richoux:
Complexity of Existential Positive First-Order Logic. CoRR abs/1011.4757 (2010)
2000 – 2009
- 2009
- [b1]Florian Richoux:
Toward a complexity classification of CSP through kernel width. École Polytechnique, Palaiseau, France, 2009 - [c2]Manuel Bodirsky, Miki Hermann, Florian Richoux:
Complexity of Existential Positive First-Order Logic. CiE 2009: 31-36 - [c1]Miki Hermann, Florian Richoux:
On the Computational Complexity of Monotone Constraint Satisfaction Problems. WALCOM 2009: 286-297
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-10 21:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
