Interpretability of rectangle packing solutions with Monte Carlo tree search
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
1 Online-Ressource.
- Sprache
-
Englisch
- Erschienen in
-
Interpretability of rectangle packing solutions with Monte Carlo tree search ; day:18 ; month:3 ; year:2024 ; pages:1-26
Journal of heuristics ; (18.3.2024), 1-26
- Urheber
-
Galán López, Yeray
González García, Cristian
García Díaz, Vicente
Núñez Valdez, Edward Rolando
Gómez Gómez, Alberto
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s10732-024-09525-2
- URN
-
urn:nbn:de:101:1-2405210855454.970991258753
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:52 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Galán López, Yeray
- González García, Cristian
- García Díaz, Vicente
- Núñez Valdez, Edward Rolando
- Gómez Gómez, Alberto
- SpringerLink (Online service)
Ähnliche Objekte (12)
Non-Preemptive Tree Packing
Packing Tree Degree Sequences
Non-Preemptive Tree Packing
Proof of the tree packing conjecture for bounded degree trees
Interpreting (un)interpretability
Prediction or interpretability?
What is Interpretability?
Re-interpreting rules interpretability
Against Interpretability: a Critical Examination of the Interpretability Problem in Machine Learning
Search trees on graphs
The limits of local search for weighted k-set packing
Efficient algorithms for disjoint Steiner trees packing problems in planar graphs
Non-Preemptive Tree Packing
Packing Tree Degree Sequences
Non-Preemptive Tree Packing
Proof of the tree packing conjecture for bounded degree trees
Interpreting (un)interpretability
Prediction or interpretability?
What is Interpretability?
Re-interpreting rules interpretability
Against Interpretability: a Critical Examination of the Interpretability Problem in Machine Learning
Search trees on graphs
The limits of local search for weighted k-set packing
Efficient algorithms for disjoint Steiner trees packing problems in planar graphs
Non-Preemptive Tree Packing
Packing Tree Degree Sequences
Non-Preemptive Tree Packing
Proof of the tree packing conjecture for bounded degree trees
Interpreting (un)interpretability
Prediction or interpretability?
What is Interpretability?
Re-interpreting rules interpretability
Against Interpretability: a Critical Examination of the Interpretability Problem in Machine Learning
Search trees on graphs
The limits of local search for weighted k-set packing