- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
1 Online-Ressource.
- Language
-
Englisch
- Bibliographic citation
-
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
- Creator
-
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
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s10732-024-09525-2
- URN
-
urn:nbn:de:101:1-2405210855454.970991258753
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:52 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- 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)
Other Objects (12)
Packing Tree Degree Sequences
Non-Preemptive Tree Packing
Non-Preemptive Tree Packing
Proof of the tree packing conjecture for bounded degree trees
Prediction or interpretability?
Interpreting (un)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
Packing Tree Degree Sequences
Non-Preemptive Tree Packing
Non-Preemptive Tree Packing
Proof of the tree packing conjecture for bounded degree trees
Prediction or interpretability?
Interpreting (un)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
Packing Tree Degree Sequences
Non-Preemptive Tree Packing
Non-Preemptive Tree Packing
Proof of the tree packing conjecture for bounded degree trees
Prediction or interpretability?
Interpreting (un)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