Autor:	Stefan Edelkamp, Eike Externest, Sebastian Kühl, Sabine Kuske
Rok vydání:	2021
Zdroj:	Proceedings of the International Symposium on Combinatorial Search. 8:163-164
ISSN:	2832-9163 2832-9171
DOI:	10.1609/socs.v8i1.18419
Popis:	In this paper we solve fundamental graph optimization problems like Maximum Clique and Minimum Coloring with recent advances of Monte-Carlo Search. The optimization problems are implemented as single-agent games in a generic state-space search framework, roughly comparable to what is encoded in PDDL for an action planner.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::08d3ec9f4c05dda3f3f840bf0e36bc09 https://doi.org/10.1609/socs.v8i1.18419 Zobrazit plný text záznamu