default search action
Arpad Rimmel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c21]Hugo Thimonier, Fabrice Popineau, Arpad Rimmel, Bich-Liên Doan:
Retrieval Augmented Deep Anomaly Detection for Tabular Data. CIKM 2024: 2250-2259 - [c20]Hugo Thimonier, Fabrice Popineau, Arpad Rimmel, Bich-Liên Doan:
Beyond Individual Input for Deep Anomaly Detection on Tabular Data. ICML 2024 - [i8]Hugo Thimonier, Fabrice Popineau, Arpad Rimmel, Bich-Liên Doan:
Making Parametric Anomaly Detection on Tabular Data Non-Parametric Again. CoRR abs/2401.17052 (2024) - [i7]Hugo Thimonier, José Lucas De Melo Costa, Fabrice Popineau, Arpad Rimmel, Bich-Liên Doan:
T-JEPA: Augmentation-Free Self-Supervised Learning for Tabular Data. CoRR abs/2410.05016 (2024) - 2023
- [j10]Pierre Bergé
, Wassim Bouaziz, Arpad Rimmel, Joanna Tomasik:
On the Parameterized Complexity of Counting Small-Sized Minimum \(\boldsymbol{(S,T)}\)-Cuts. SIAM J. Discret. Math. 37(2): 964-996 (2023) - [c19]Marc Velay, Bich-Liên Doan, Arpad Rimmel, Fabrice Popineau, Fabrice Daniel:
Benchmarking Robustness of Deep Reinforcement Learning approaches to Online Portfolio Management. INISTA 2023: 1-6 - [i6]Hugo Thimonier, Fabrice Popineau, Arpad Rimmel, Bich-Liên Doan:
Beyond Individual Input for Deep Anomaly Detection on Tabular Data. CoRR abs/2305.15121 (2023) - [i5]Marc Velay, Bich-Liên Doan, Arpad Rimmel, Fabrice Popineau, Fabrice Daniel:
Benchmarking Robustness of Deep Reinforcement Learning approaches to Online Portfolio Management. CoRR abs/2306.10950 (2023) - [i4]Hugo Thimonier, Fabrice Popineau, Arpad Rimmel, Bich-Liên Doan, Fabrice Daniel:
Comparative Evaluation of Anomaly Detection Methods for Fraud Detection in Online Credit Card Payments. CoRR abs/2312.13896 (2023) - 2022
- [c18]Hugo Thimonier, Fabrice Popineau, Arpad Rimmel, Bich-Liên Doan, Fabrice Daniel:
TracInAD: Measuring Influence for Anomaly Detection. IJCNN 2022: 1-6 - [i3]Hugo Thimonier, Fabrice Popineau, Arpad Rimmel, Bich-Liên Doan, Fabrice Daniel:
TracInAD: Measuring Influence for Anomaly Detection. CoRR abs/2205.01362 (2022) - 2020
- [c17]Julien Gérard, Joanna Tomasik, Christèle Morisseau, Arpad Rimmel, Gilles Vieillard:
Micro-Doppler Signal Representation for Drone Classification by Deep Learning. EUSIPCO 2020: 1561-1565
2010 – 2019
- 2019
- [j9]Pierre Bergé, Jean Desmarchelier, Wen Guo, Aurélie Lefebvre, Arpad Rimmel, Joanna Tomasik
Multiple Canadians on the road: minimizing the distance competitive ratio. J. Comb. Optim. 38(4): 1086-1100 (2019) - [j8]Pierre Bergé, Arpad Rimmel, Joanna Tomasik:
On the parameterized complexity of separating certain sources from the target. Theor. Comput. Sci. 795: 183-193 (2019) - [c16]Pierre Bergé, Benjamin Mouscadet, Arpad Rimmel, Joanna Tomasik:
Fixed-Parameter Tractability of Counting Small Minimum (S, T)-Cuts. WG 2019: 79-92 - [i2]Pierre Bergé, Benjamin Mouscadet, Arpad Rimmel, Joanna Tomasik:
Fixed-parameter tractability of counting small minimum (S, T)-cuts. CoRR abs/1907.02353 (2019) - 2018
- [j7]Kaourintin Le Guiban, Arpad Rimmel, Marc-Antoine Weisser, Joanna Tomasik
The First Approximation Algorithm for the Maximin Latin Hypercube Design Problem. Oper. Res. 66(1): 253-266 (2018) - [j6]Ghada Ben Hassine, Pierre Bergé, Arpad Rimmel, Joanna Tomasik
A lower bound for weak Schur numbers with a deterministic algorithm. J. Discrete Algorithms 51: 12-25 (2018) - [j5]Kaourintin Le Guiban, Arpad Rimmel, Marc-Antoine Weisser, Joanna Tomasik
Completion of partial Latin Hypercube Designs: NP-completeness and inapproximability. Theor. Comput. Sci. 715: 1-20 (2018) - [c15]Pierre Bergé, Julien Hemery, Arpad Rimmel, Joanna Tomasik:
On the Competitiveness of Memoryless Strategies for the k-Canadian Traveller Problem. COCOA 2018: 566-576 - [c14]Christian Hamelain, Kaourintin Le Guiban, Arpad Rimmel, Joanna Tomasik:
Bandits Help Simulated Annealing to Complete a Maximin Latin Hypercube Design. CPAIOR 2018: 280-288 - [c13]Pierre Bergé, Julien Hemery, Arpad Rimmel, Joanna Tomasik:
The Competitiveness of Randomized Strategies for Canadians via Systems of Linear Inequalities. ISCIS 2018: 96-103 - 2016
- [c12]Pierre Bergé, Baptiste Cavarec
Restricting the search space to boost Quantum Annealing performance. CEC 2016: 3238-3245 - [c11]Pierre Bergé, Kaourintin Le Guiban, Arpad Rimmel, Joanna Tomasik:
Search Space Exploration and an Optimization Criterion for Hard Design Problems. GECCO (Companion) 2016: 43-44 - [i1]Pierre Bergé, Kaourintin Le Guiban, Arpad Rimmel, Joanna Tomasik:
On Simulated Annealing Dedicated to Maximin Latin Hypercube Designs. CoRR abs/1608.07225 (2016) - 2014
- [c10]Arpad Rimmel, Fabien Teytaud:
A Survey of Meta-heuristics Used for Computing Maximin Latin Hypercube. EvoCOP 2014: 25-36 - 2011
- [c9]Arpad Rimmel, Fabien Teytaud, Tristan Cazenave:
Optimization of the Nested Monte-Carlo Algorithm on the Traveling Salesman Problem with Time Windows. EvoApplications (2) 2011: 501-510 - 2010
- [j4]Jean-Baptiste Hoock, Chang-Shing Lee
Intelligent Agents for the Game of Go. IEEE Comput. Intell. Mag. 5(4): 28-42 (2010) - [j3]Arpad Rimmel, Olivier Teytaud, Chang-Shing Lee
Current Frontiers in Computer Go. IEEE Trans. Comput. Intell. AI Games 2(4): 229-238 (2010) - [c8]Amine Bourki, Guillaume Chaslot, Matthieu Coulm, Vincent Danjean, Hassen Doghmen, Jean-Baptiste Hoock, Thomas Hérault
Scalability and Parallelization of Monte-Carlo Tree Search. Computers and Games 2010: 48-58 - [c7]Arpad Rimmel, Fabien Teytaud, Olivier Teytaud:
Biasing Monte-Carlo Simulations through RAVE Values. Computers and Games 2010: 59-68 - [c6]Arpad Rimmel, Fabien Teytaud:
Multiple Overlapping Tiles for Contextual Monte Carlo Tree Search. EvoApplications (1) 2010: 201-210
2000 – 2009
- 2009
- [j2]Guillaume Chaslot, L. Chatriot, Christophe Fiter
Combiner connaissances expertes, hors-ligne, transientes et en ligne pour l'exploration Monte-Carlo. Apprentissage et MC. Rev. d'Intelligence Artif. 23(2-3): 203-220 (2009) - [j1]Chang-Shing Lee
The Computational Intelligence of MoGo Revealed in Taiwan's Computer Go Tournaments. IEEE Trans. Comput. Intell. AI Games 1(1): 73-89 (2009) - [c5]Guillaume Chaslot, Christophe Fiter
Adding Expert Knowledge and Exploration in Monte-Carlo Tree Search. ACG 2009: 1-13 - [c4]Pierre Audouard, Guillaume Chaslot, Jean-Baptiste Hoock, Julien Perez, Arpad Rimmel, Olivier Teytaud:
Grid Coevolution for Adaptive Simulations: Application to the Building of Opening Books in the Game of Go. EvoWorkshops 2009: 323-332 - [c3]Chang-Shing Lee
A novel ontology for computer go knowledge management. FUZZ-IEEE 2009: 1056-1061 - [c2]Frédéric de Mesmay, Arpad Rimmel, Yevgen Voronenko, Markus Püschel:
Bandit-based optimization on graphs with application to library performance tuning. ICML 2009: 729-736 - 2008
- [c1]Sylvain Gelly, Jean-Baptiste Hoock, Arpad Rimmel, Olivier Teytaud, Y. Kalemkarian:
The Parallelization of Monte-Carlo Planning - Parallelization of MC-Planning. ICINCO-ICSO 2008: 244-249
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-11-15 19:31 CET 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: