Arpad Rimmel

According to our database¹, Arpad Rimmel authored at least 33 papers between 2008 and 2024.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of four.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2024

Making Parametric Anomaly Detection on Tabular Data Non-Parametric Again.

[BibT_eX]

[DOI]

CoRR, 2024

2023

On the Parameterized Complexity of Counting Small-Sized Minimum \(\boldsymbol{(S,T)}\)-Cuts.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., June, 2023

Comparative Evaluation of Anomaly Detection Methods for Fraud Detection in Online Credit Card Payments.

[BibT_eX]

[DOI]

CoRR, 2023

Beyond Individual Input for Deep Anomaly Detection on Tabular Data.

[BibT_eX]

[DOI]

CoRR, 2023

Benchmarking Robustness of Deep Reinforcement Learning approaches to Online Portfolio Management.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Innovations in Intelligent Systems and Applications, 2023

2022

TracInAD: Measuring Influence for Anomaly Detection.

[BibT_eX]

[DOI]

Proceedings of the International Joint Conference on Neural Networks, 2022

2020

Micro-Doppler Signal Representation for Drone Classification by Deep Learning.

[BibT_eX]

[DOI]

Proceedings of the 28th European Signal Processing Conference, 2020

2019

On the parameterized complexity of separating certain sources from the target.

[BibT_eX]

[DOI]

Pierre Bergé

Arpad Rimmel

Joanna Tomasik

Theor. Comput. Sci., 2019

Multiple Canadians on the road: minimizing the distance competitive ratio.

[BibT_eX]

[DOI]

J. Comb. Optim., 2019

Fixed-Parameter Tractability of Counting Small Minimum (S, T)-Cuts.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2019

2018

Completion of partial Latin Hypercube Designs: NP-completeness and inapproximability.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

A lower bound for weak Schur numbers with a deterministic algorithm.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2018

The First Approximation Algorithm for the Maximin Latin Hypercube Design Problem.

[BibT_eX]

[DOI]

Oper. Res., 2018

The Competitiveness of Randomized Strategies for Canadians via Systems of Linear Inequalities.

[BibT_eX]

[DOI]

Proceedings of the Computer and Information Sciences - 32nd International Symposium, 2018

Bandits Help Simulated Annealing to Complete a Maximin Latin Hypercube Design.

[BibT_eX]

[DOI]

Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2018

On the Competitiveness of Memoryless Strategies for the k-Canadian Traveller Problem.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2018

2016

On Simulated Annealing Dedicated to Maximin Latin Hypercube Designs.

[BibT_eX]

[DOI]

CoRR, 2016

Search Space Exploration and an Optimization Criterion for Hard Design Problems.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2016

Restricting the search space to boost Quantum Annealing performance.

[BibT_eX]

[DOI]

Proceedings of the IEEE Congress on Evolutionary Computation, 2016

2014

A Survey of Meta-heuristics Used for Computing Maximin Latin Hypercube.

[BibT_eX]

[DOI]

Arpad Rimmel

Fabien Teytaud

Proceedings of the Evolutionary Computation in Combinatorial Optimisation, 2014

2011

Optimization of the Nested Monte-Carlo Algorithm on the Traveling Salesman Problem with Time Windows.

[BibT_eX]

[DOI]

Arpad Rimmel

Fabien Teytaud

Tristan Cazenave

Proceedings of the Applications of Evolutionary Computation, 2011

2010

Current Frontiers in Computer Go.

[BibT_eX]

[DOI]

IEEE Trans. Comput. Intell. AI Games, 2010

Intelligent Agents for the Game of Go.

[BibT_eX]

[DOI]

IEEE Comput. Intell. Mag., 2010

Multiple Overlapping Tiles for Contextual Monte Carlo Tree Search.

[BibT_eX]

[DOI]

Arpad Rimmel

Fabien Teytaud

Proceedings of the Applications of Evolutionary Computation, 2010

Biasing Monte-Carlo Simulations through RAVE Values.

[BibT_eX]

[DOI]

Arpad Rimmel

Fabien Teytaud

Olivier Teytaud

Proceedings of the Computers and Games - 7th International Conference, 2010

Scalability and Parallelization of Monte-Carlo Tree Search.

[BibT_eX]

[DOI]

Proceedings of the Computers and Games - 7th International Conference, 2010

2009

The Computational Intelligence of MoGo Revealed in Taiwan's Computer Go Tournaments.

[BibT_eX]

[DOI]

IEEE Trans. Comput. Intell. AI Games, 2009

Combiner connaissances expertes, hors-ligne, transientes et en ligne pour l'exploration Monte-Carlo. Apprentissage et MC.

[BibT_eX]

[DOI]

Rev. d'Intelligence Artif., 2009

Bandit-based optimization on graphs with application to library performance tuning.

[BibT_eX]

[DOI]

Proceedings of the 26th Annual International Conference on Machine Learning, 2009

A novel ontology for computer go knowledge management.

[BibT_eX]

[DOI]

Proceedings of the FUZZ-IEEE 2009, 2009

Grid Coevolution for Adaptive Simulations: Application to the Building of Opening Books in the Game of Go.

[BibT_eX]

[DOI]

Proceedings of the Applications of Evolutionary Computing, 2009

Adding Expert Knowledge and Exploration in Monte-Carlo Tree Search.

[BibT_eX]

[DOI]

Proceedings of the Advances in Computer Games, 12th International Conference, 2009

2008

The Parallelization of Monte-Carlo Planning - Parallelization of MC-Planning.

[BibT_eX]

Proceedings of the ICINCO 2008, 2008

Arpad Rimmel

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...