K-Focal Search for Slow Learned Heuristics
Bounded suboptimal heuristic search is a family of search algorithms capable of solving hard combinatorial problems, returning suboptimal solutions within a given bound. Recent machine learning approaches have been shown to learn accurate heuristic functions. Learned heuristics, however, are slow to...
Na minha lista:
| Principais autores: | , , , |
|---|---|
| Format: | Artigo |
| Sprog: | Inglês |
| Udgivet: |
IEEE
2024-01-01
|
| Serier: | IEEE Access |
| Fag: | |
| Online adgang: | https://ieeexplore.ieee.org/document/10373859/ |
| Tags: |
Ingen Tags, Vær først til at tagge denne postø!
|