| Bounded suboptimal search: A direct approach using inadmissible estimates JT Thayer, W Ruml IJCAI 2011, 674-679, 2011 | 134 | 2011 |
| The joy of forgetting: Faster anytime search via restarting S Richter, J Thayer, W Ruml Proceedings of the International Conference on Automated Planning and …, 2010 | 116 | 2010 |
| A comparison of greedy search algorithms C Wilt, J Thayer, W Ruml proceedings of the international symposium on combinatorial search 1 (1 …, 2010 | 100 | 2010 |
| Learning inadmissible heuristics during search J Thayer, A Dionne, W Ruml Proceedings of the International Conference on Automated Planning and …, 2011 | 99 | 2011 |
| Faster than Weighted A*: An Optimistic Approach to Bounded Suboptimal Search. JT Thayer, W Ruml ICAPS, 355-362, 2008 | 91 | 2008 |
| Using distance estimates in heuristic search J Thayer, W Ruml Proceedings of the International Conference on Automated Planning and …, 2009 | 52 | 2009 |
| Anytime heuristic search: Frameworks and algorithms J Thayer, W Ruml Proceedings of the International Symposium on Combinatorial Search 1 (1 …, 2010 | 49 | 2010 |
| Faster bounded-cost search using inadmissible estimates J Thayer, R Stern, A Felner, W Ruml Proceedings of the International Conference on Automated Planning and …, 2012 | 46 | 2012 |
| Deadline-aware search using on-line measures of behavior A Dionne, J Thayer, W Ruml Proceedings of the International Symposium on Combinatorial Search 2 (1), 39-46, 2011 | 46 | 2011 |
| Better parameter-free anytime search by minimizing time between solutions J Thayer, J Benton, M Helmert Proceedings of the International Symposium on Combinatorial Search 3 (1 …, 2012 | 38 | 2012 |
| Using alternative suboptimality bounds in heuristic search R Valenzano, SJ Arfaee, J Thayer, R Stern, N Sturtevant Proceedings of the International Conference on Automated Planning and …, 2013 | 26 | 2013 |
| Using distance estimates in heuristic search: A re-evaluation JT Thayer, W Ruml, J Kreis Symposium on Combinatorial Search, 2009 | 18 | 2009 |
| Finding acceptable solutions faster using inadmissible information J Thayer, W Ruml Proceedings of the International Symposium on Combinatorial Search 1 (1), 98-99, 2010 | 16 | 2010 |
| Fast and loose in bounded suboptimal heuristic search JT Thayer, W Ruml, E Bitton Proceedings of the First International Symposium on Search Techniques in …, 2008 | 14 | 2008 |
| Are We There Yet?—Estimating Search Progress J Thayer, R Stern, L Lelis Proceedings of the International Symposium on Combinatorial Search 3 (1 …, 2012 | 12 | 2012 |
| Comparing strategic and tactical responses to cyber threats JT Thayer, M Burstein, RP Goldman, U Kuter, P Robertson, R Laddaga 2013 IEEE 7th international conference on self-adaptation and self …, 2013 | 10 | 2013 |
| Heuristic search under time and quality bounds JT Thayer Ph. D. Dissertation, University of New Hampshire, 2012 | 9 | 2012 |
| HACKAR: helpful advice for code knowledge and attack resilience U Kuter, M Burstein, J Benton, D Bryce, J Thayer, S McCoy Proceedings of the AAAI Conference on Artificial Intelligence 29 (2), 3987-3992, 2015 | 8 | 2015 |
| Improving trust estimates in planning domains with rare failure events CM Potts, K Krebsbach, J Thayer, D Musliner 2013 AAAI Spring Symposium Series, 2013 | 3 | 2013 |
| Alternative forms of bounded suboptimal search R Valenzano, SJ Arfaee, J Thayer, R Stern Proceedings of the International Symposium on Combinatorial Search 3 (1 …, 2012 | 2 | 2012 |
