Follow
Jordan Tyler Thayer
Title
Cited by
Cited by
Year
The joy of forgetting: Faster anytime search via restarting
S Richter, JT Thayer, W Ruml
Twentieth International Conference on Automated Planning and Scheduling, 2010
1072010
Bounded suboptimal search: A direct approach using inadmissible estimates
JT Thayer, W Ruml
Twenty-Second International Joint Conference on Artificial Intelligence, 2011
1042011
Learning inadmissible heuristics during search
J Thayer, A Dionne, W Ruml
Proceedings of the International Conference on Automated Planning and …, 2011
922011
Faster than Weighted A*: An Optimistic Approach to Bounded Suboptimal Search.
JT Thayer, W Ruml
ICAPS, 355-362, 2008
862008
A comparison of greedy search algorithms
CM Wilt, JT Thayer, W Ruml
third annual symposium on combinatorial search, 2010
752010
Using distance estimates in heuristic search
JT Thayer, W Ruml
Nineteenth International Conference on Automated Planning and Scheduling, 2009
502009
Anytime heuristic search: Frameworks and algorithms
J Thayer, W Ruml
International Symposium on Combinatorial Search 1 (1), 2010
462010
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
442012
Deadline-aware search using on-line measures of behavior
A Dionne, J Thayer, W Ruml
International Symposium on Combinatorial Search 2 (1), 2011
392011
Better parameter-free anytime search by minimizing time between solutions
J Thayer, J Benton, M Helmert
International Symposium on Combinatorial Search 3 (1), 2012
352012
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
222013
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
JT Thayer, W Ruml
Third Annual Symposium on Combinatorial Search, 2010
152010
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
132008
Are We There Yet?—Estimating Search Progress
J Thayer, R Stern, L Lelis
International Symposium on Combinatorial Search 3 (1), 2012
92012
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
Twenty-Seventh IAAI Conference, 2015
82015
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
72013
Improving trust estimates in planning domains with rare failure events
CM Potts, K Krebsbach, J Thayer, D Musliner
2013 AAAI Spring Symposium Series, 2013
42013
Alternative Forms of Bounded Suboptimal Search
R Valenzano, SJ Arfaee, J Thayer, R Stern
International Symposium on Combinatorial Search 3 (1), 2012
12012
The system can't perform the operation now. Try again later.
Articles 1–20