Warm-starting nested rollout policy adaptation with optimal stopping
Abstract Nested Rollout Policy Adaptation (NRPA) is an approach using online learning
policies in a nested structure. It has achieved a great result in a variety of difficult …
policies in a nested structure. It has achieved a great result in a variety of difficult …
Comparing search algorithms on the retrosynthesis problem
M Roucairol, T Cazenave - Molecular Informatics, 2024 - Wiley Online Library
In this article we try different algorithms, namely Nested Monte Carlo Search and Greedy
Best First Search, on AstraZeneca's open source retrosynthetic tool: AiZynthFinder. We …
Best First Search, on AstraZeneca's open source retrosynthetic tool: AiZynthFinder. We …
Monte-Carlo tree search for logistics
S Edelkamp, M Gath, C Greulich, M Humann… - … : Proceedings of the 2nd …, 2016 - Springer
In this paper we review recent advances of randomized AI search in solving industrially
relevant optimization problems. The method we focus on is a sampling-based solution …
relevant optimization problems. The method we focus on is a sampling-based solution …
Algorithm and knowledge engineering for the TSPTW problem
S Edelkamp, M Gath, T Cazenave… - 2013 IEEE Symposium …, 2013 - ieeexplore.ieee.org
The well-known traveling salesman problem (TSP) is concerned with determining the
shortest route for a vehicle while visiting a set of cities exactly once. We consider knowledge …
shortest route for a vehicle while visiting a set of cities exactly once. We consider knowledge …
Monkey business: Reinforcement learning meets neighborhood search for virtual network embedding
In this article, we consider the Virtual Network Embedding (VNE) problem for 5G networks
slicing. This problem requires to allocate multiple Virtual Networks (VN) on a substrate …
slicing. This problem requires to allocate multiple Virtual Networks (VN) on a substrate …
Monte Carlo inverse folding
T Cazenave, T Fournier - Monte Carlo Search: First Workshop, MCS 2020 …, 2021 - Springer
Abstract The RNA Inverse Folding problem comes from computational biology. The goal is to
find a molecule that has a given folding. It is important for scientific fields such as …
find a molecule that has a given folding. It is important for scientific fields such as …
Monte-Carlo tree search for 3D packing with object orientation
S Edelkamp, M Gath, M Rohde - … : 37th Annual German Conference on AI …, 2014 - Springer
In this paper we look at packing problems that naturally arise in container loading. Given a
set of 3D iso-oriented objects and a container, the task is to find a packing sequence of the …
set of 3D iso-oriented objects and a container, the task is to find a packing sequence of the …
Monte-carlo tree search for the multiple sequence alignment problem
S Edelkamp, Z Tang - Proceedings of the International Symposium on …, 2015 - ojs.aaai.org
The paper considers solving the multiple sequence alignment, a combinatorial challenge in
computational biology, where several DNA RNA, or protein sequences are to be arranged …
computational biology, where several DNA RNA, or protein sequences are to be arranged …
Monte Carlo search algorithms for network traffic engineering
Abstract The aim of Traffic Engineering is to provide routing configurations in networks such
that the used resources are minimized while maintaining a high level of quality of service …
that the used resources are minimized while maintaining a high level of quality of service …
Monte Carlo graph coloring
Graph Coloring is probably one of the most studied and famous problem in graph
algorithms. Exact methods fail to solve instances with more than few hundred vertices …
algorithms. Exact methods fail to solve instances with more than few hundred vertices …