Hugo Tremblay

19 papers B 4C 3Journal 7Unranked 5
YearRankTypeTitle / Venue / Authors
2026 J jnl
Breaking down the challenge: A comprehensive framework for evaluating enemy difficulty with automated behavior tree analytics.
Entertain. Comput.
Hugo Tremblay, David Ponton, Lucas Gonzalez, Yannick Francillette, Bruno Bouchard
2025 J jnl
A Comprehensive Model of Automated Evaluation of Difficulty in Platformer Games.
Games Res. Pract.
Yannick Francillette, Hugo Tremblay, Bruno Bouchard, Bob-Antoine Menelas
2025 J jnl
A theory of fine-grained lineage for functions on structured objects.
Theor. Comput. Sci.
Sylvain Hallé, Hugo Tremblay
2024 B conf
A heuristic method to solve an assignment problem using a random walk approximation.
KES
Léo Monteiro, Hugo Tremblay, Sara Séguin
2024 — conf
Automated Difficulty Assessment Model for Comprehensive Difficulty in Games.
GEM
Yannick Francillette, Hugo Tremblay, Bruno Bouchard
2024 J jnl
On the generation of discrete figures with connectivity constraints.
RAIRO Theor. Informatics Appl.
Hugo Tremblay, Julien Vernay
2023 — conf
Automated Difficulty Assessment Model for Platformer Games: A Comprehensive Approach.
GEM
Yannick Francillette, Hugo Tremblay, Bruno Bouchard, Simon Lescieux, Mathis Rozon, Jules Linard
2023 B conf
Robotic Process Automation (RPA) using a heuristic method and the effective resistance of a graph.
KES
Hugo Tremblay, Sara Séguin, Laurie-Ann Boily, Véronique Du Paul, Sophie Lalancette
2021 — conf
Foundations of Fine-Grained Explainability.
CAV (2)
Sylvain Hallé, Hugo Tremblay
2021 B conf
Minimizing the number of robots required for a Robotic Process Automation (RPA) problem.
KES
Sara Séguin, Hugo Tremblay, Imène Benkalaï, David-Emmanuel Perron-Chouinard, Xavier Lebeuf
2021 B conf
Minimizing the number of robots required for a Robotic Process Automation (RPA) problem.
KES
Sara Séguin, Hugo Tremblay, Imène Benkalaï, David-Emmanuel Perron-Chouinard, Xavier Lebeuf
2020 — conf
A Generic Explainability Framework for Function Circuits.
TaPP
Sylvain Hallé, Hugo Tremblay
2020 C conf
Computing a lower bound for the solution of a Robotic Process Automation (RPA) problem using network flows.
CoDIT
Imène Benkalaï, Sara Séguin, Hugo Tremblay, Geoffrey Glangine
2020 J jnl
The cross cyclomatic complexity: a bi-dimensional measure for program complexity on graphs.
CoRR
Hugo Tremblay, Fábio Petrillo
2016 J jnl
Efficient operations on discrete paths.
Theor. Comput. Sci.
Alexandre Blondin Massé, Srecko Brlek, Hugo Tremblay
2016 C conf
Parallelogram Morphisms and Circular Codes.
LATA
Alexandre Blondin Massé, Mélodie Lapointe, Hugo Tremblay
2014 — conf
Efficient Computation of the Outer Hull of a Discrete Path.
DGCI
Srecko Brlek, Hugo Tremblay, Jérôme Tremblay, Romaine Weber
2014 J jnl
Exhaustive generation of atomic combinatorial differential operators.
Theor. Comput. Sci.
Hugo Tremblay, Gilbert Labelle, Srecko Brlek, Alexandre Blondin Massé
2014 C conf
On the Arithmetics of Discrete Figures.
LATA
Alexandre Blondin Massé, Amadou Makhtar Tall, Hugo Tremblay