Arpad Rimmel

Arpad.Rimmel [at] centralesupelec.fr

Publications :

  • Article dans une revue - 9 documents
    • Pierre Bergé, Arpad Rimmel, Joanna Tomasik. On the parameterized complexity of separating certain sources from the target, 2019-11. (https://hal.archives-ouvertes.fr/hal-02343987)
    • Pierre Bergé, Jean Desmarchelier, Wen Guo, Aurélie Lefebvre, Arpad Rimmel, Joanna Tomasik. Multiple Canadians on the road: minimizing the distance competitive ratio, 2019-11. (https://hal.archives-ouvertes.fr/hal-02343983)
    • Ghada Ben Hassine, Pierre Bergé, Arpad Rimmel, Joanna Tomasik. A lower bound for weak Schur numbers with a deterministic algorithm, 2018-07. (https://hal.archives-ouvertes.fr/hal-01940051)
    • Kaourintin Le Guiban, Arpad Rimmel, Marc-Antoine Weisser, Joanna Tomasik. Completion of partial Latin Hypercube Designs: NP-completeness and inapproximability, 2018-03. (https://hal.archives-ouvertes.fr/hal-01702464)
    • Kaourintin Le Guiban, Arpad Rimmel, Marc-Antoine Weisser, Joanna Tomasik. The First Approximation Algorithm for the Maximin Latin Hypercube Design Problem, 2018-03-01. (https://hal.archives-ouvertes.fr/hal-01702467)
    • Jean-Baptiste Hoock, Chang-Shing Lee, Arpad Rimmel, Fabien Teytaud, Olivier Teytaud, Mei-Hui Wang. Intelligent Agents for the Game of Go, 2010-11. (https://hal.inria.fr/inria-00544758v2)
    • Arpad Rimmel, Olivier Teytaud, Chang-Shing Lee, Shi-Jim Yen, Mei-Hui Wang, Shang-Rong Tsai. Current Frontiers in Computer Go, 2010. (https://hal.inria.fr/inria-00544622)
    • Chang-Shing Lee, Mei-Hui Wang, Guillaume Chaslot, Jean-Baptiste Hoock, Arpad Rimmel, Olivier Teytaud, Shang-Rong Tsai, Shun-Chin Hsu, Tzung-Pei Hong. The Computational Intelligence of MoGo Revealed in Taiwan's Computer Go Tournaments, 2009. (https://hal.inria.fr/inria-00369786)
    • Louis Chatriot, Christophe Fiter, Guillaume Chaslot, Sylvain Gelly, Jean-Baptiste Hoock, J. Perez, Arpad Rimmel, Olivier Teytaud. Combiner connaissances expertes, hors-ligne, transientes et en ligne pour l'exploration Monte-Carlo, 2008. (https://hal.inria.fr/inria-00343509)
  • Chapitre d'ouvrage - 1 document
  • Rapport - 2 documents
  • Communication dans un congrès - 17 documents
    • Pierre Bergé, Benjamin Mouscadet, Arpad Rimmel, Joanna Tomasik. Fixed-parameter tractability of counting small minimum (S,T)-cuts, 2019-06-19. (https://hal.archives-ouvertes.fr/hal-02105265)
    • Pierre Bergé, Julien Hemery, Arpad Rimmel, Joanna Tomasik. On the competitiveness of memoryless strategies for the $k$-Canadian Traveller Problem, 2018-12-15. (https://hal.archives-ouvertes.fr/hal-02022459)
    • Pierre Bergé, Julien Hemery, Arpad Rimmel, Joanna Tomasik. The Competitiveness of Randomized Strategies for Canadians via Systems of Linear Inequalities, 2018-09-20. (https://hal.archives-ouvertes.fr/hal-01896511)
    • Christian Hamelain, Kaourintin Le Guiban, Arpad Rimmel, Joanna Tomasik. Bandits Help Simulated Annealing to Complete a Maximin Latin Hypercube Design, 2018-06-26. (https://hal.archives-ouvertes.fr/hal-01796315)
    • Pierre Bergé, Baptiste Cavarec, Arpad Rimmel, Joanna Tomasik. Restricting the search space to boost Quantum Annealing performance, 2016-07-24. (https://hal.archives-ouvertes.fr/hal-01295746)
    • Pierre Bergé, Arpad Rimmel, Kaourintin Le Guiban, Joanna Tomasik. Search space exploration and an optimization criterion for hard design problems, 2016-07-20. (https://hal.archives-ouvertes.fr/hal-01308582)
    • Arpad Rimmel, Fabien Teytaud. A Survey of Meta-Heuristics used for Computing Maximin Latin Hypercube, 2014-04-23. (https://hal-supelec.archives-ouvertes.fr/hal-00926729)
    • Arpad Rimmel, Fabien Teytaud, Tristan Cazenave. Optimization of the Nested Monte-Carlo Algorithm on the Traveling Salesman Problem with Time Windows, 2011-04-27. (https://hal.inria.fr/inria-00563668)
    • Amine Bourki, Guillaume Chaslot, Matthieu Coulm, Vincent Danjean, Hassen Doghmen, Thomas Herault, Jean-Baptiste Hoock, Arpad Rimmel, Fabien Teytaud, Olivier Teytaud, Paul Vayssière, Ziqin Yu. Scalability and Parallelization of Monte-Carlo Tree Search, 2010-09-24. (https://hal.inria.fr/inria-00512854)
    • Arpad Rimmel, Fabien Teytaud, Olivier Teytaud. Biasing Monte-Carlo Simulations through RAVE Values, 2010-09-24. (https://hal.inria.fr/inria-00485555)
    • Arpad Rimmel, Fabien Teytaud. Multiple Overlapping Tiles for Contextual Monte Carlo Tree Search, 2010-04-07. (https://hal.inria.fr/inria-00456422v2)
    • Frédéric de Mesmay, Arpad Rimmel, Yevgen Voronenko, Markus Püschel. Bandit-Based Optimization on Graphs with Application to Library Performance Tuning, 2009-06. (https://hal.inria.fr/inria-00379523)
    • Chang-Shing Lee, Wang Mei-Hui, Tzung-Pei Hong, Guillaume Chaslot, Jean-Baptiste Hoock, Arpad Rimmel, Olivier Teytaud, Yau-Hwang Kuo. A Novel Ontology for Computer Go Knowledge Management, 2009. (https://hal.inria.fr/inria-00386476)
    • Guillaume Chaslot, Christophe Fiter, Jean-Baptiste Hoock, Arpad Rimmel, Olivier Teytaud. Adding expert knowledge and exploration in Monte-Carlo Tree Search, 2009. (https://hal.inria.fr/inria-00386477)
    • Pierre Audouard, Guillaume Chaslot, Jean-Baptiste Hoock, Arpad Rimmel, J. Perez, Olivier Teytaud. Grid coevolution for adaptive simulations; application to the building of opening books in the game of Go, 2009. (https://hal.inria.fr/inria-00369783)
    • Louis Chatriot, Sylvain Gelly, Jean-Baptiste Hoock, Julien Pérez, Arpad Rimmel, Olivier Teytaud. Introduction de connaissances expertes en Bandit-Based Monte-Carlo Planning avec application au Computer-Go, 2008-06. (https://hal.inria.fr/inria-00287883)
    • Sylvain Gelly, Jean-Baptiste Hoock, Arpad Rimmel, Olivier Teytaud, Yann Kalemkarian. On the Parallelization of Monte-Carlo planning, 2008-05. (https://hal.inria.fr/inria-00287867)