Follow
Jordan Tyler Thayer
Jordan Tyler Thayer
SEP
Verified email at sep.com
Title
Cited by
Cited by
Year
Bounded suboptimal search: A direct approach using inadmissible estimates
JT Thayer, W Ruml
IJCAI 2011, 674-679, 2011
1292011
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
1152010
Learning inadmissible heuristics during search
J Thayer, A Dionne, W Ruml
Proceedings of the International Conference on Automated Planning and …, 2011
972011
A comparison of greedy search algorithms
C Wilt, J Thayer, W Ruml
Proceedings of the International Symposium on Combinatorial Search 1 (1 …, 2010
952010
Faster than Weighted A*: An Optimistic Approach to Bounded Suboptimal Search.
JT Thayer, W Ruml
ICAPS, 355-362, 2008
922008
Using distance estimates in heuristic search
J Thayer, W Ruml
Proceedings of the International Conference on Automated Planning and …, 2009
512009
Anytime heuristic search: Frameworks and algorithms
J Thayer, W Ruml
Proceedings of the International Symposium on Combinatorial Search 1 (1 …, 2010
472010
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
452012
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
452011
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
382012
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
252013
Using distance estimates in heuristic search: A re-evaluation
JT Thayer, W Ruml, J Kreis
Symposium on Combinatorial Search, 2009
172009
Finding acceptable solutions faster using inadmissible information
J Thayer, W Ruml
Proceedings of the International Symposium on Combinatorial Search 1 (1), 98-99, 2010
162010
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
152008
Are We There Yet?—Estimating Search Progress
J Thayer, R Stern, L Lelis
Proceedings of the International Symposium on Combinatorial Search 3 (1 …, 2012
102012
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
92013
Heuristic search under time and quality bounds
JT Thayer
Ph. D. Dissertation, University of New Hampshire, 2012
92012
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
82015
Improving trust estimates in planning domains with rare failure events
CM Potts, K Krebsbach, J Thayer, D Musliner
2013 AAAI Spring Symposium Series, 2013
32013
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
22012
The system can't perform the operation now. Try again later.
Articles 1–20