Abstract
In this paper we discuss and experiment with Lazy A-, a variant of A- where heuristics are evaluated lazily and with rational lazy A-, which decides whether to compute the more expensive heuristics at all, based on a myopic value of information estimate. Full version appears in IJCAI-2013 (Tolpin et al. 2013)
| Original language | English |
|---|---|
| Pages | 220-221 |
| Number of pages | 2 |
| State | Published - 2013 |
| Externally published | Yes |
| Event | 6th Annual Symposium on Combinatorial Search, SoCS 2013 - Leavenworth, WA, United States Duration: 11 Jul 2013 → 13 Jul 2013 |
Conference
| Conference | 6th Annual Symposium on Combinatorial Search, SoCS 2013 |
|---|---|
| Country/Territory | United States |
| City | Leavenworth, WA |
| Period | 11/07/13 → 13/07/13 |