Jordan Tyler Thayer

According to our database, Jordan Tyler Thayer authored at least 18 papers between 2008 and 2015.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2015

HACKAR: Helpful Advice for Code Knowledge and Attack Resilience.

Ugur Kuter, Mark H. Burstein, J. Benton, Daniel Bryce, Jordan Tyler Thayer, Steve McCoy

Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2013

Comparing Strategic and Tactical Responses to Cyber Threats.

Jordan Tyler Thayer, Mark H. Burstein, Robert P. Goldman, Ugur Kuter, Paul Robertson, Robert Laddaga

Proceedings of the 7th IEEE International Conference on Self-Adaptation and Self-Organizing Systems Workshops, 2013

Using Alternative Suboptimality Bounds in Heuristic Search.

Richard Anthony Valenzano, Shahab Jabbari Arfaee, Jordan Tyler Thayer, Roni Stern, Nathan R. Sturtevant

Proceedings of the Twenty-Third International Conference on Automated Planning and Scheduling, 2013

Improving Trust Estimates in Planning Domains with Rare Failure Events.

Colin M. Potts, Kurt D. Krebsbach, Jordan Tyler Thayer, David J. Musliner

Proceedings of the Trust and Autonomous Systems, 2013

2012

Alternative Forms of Bounded Suboptimal Search.

Richard Anthony Valenzano, Shahab Jabbari Arfaee, Jordan Tyler Thayer, Roni Stern

Proceedings of the Fifth Annual Symposium on Combinatorial Search, 2012

Are We There Yet? - Estimating Search Progress.

Jordan Tyler Thayer, Roni Stern, Levi H. S. Lelis

Proceedings of the Fifth Annual Symposium on Combinatorial Search, 2012

Better Parameter-Free Anytime Search by Minimizing Time Between Solutions.

Jordan Tyler Thayer, J. Benton, Malte Helmert

Proceedings of the Fifth Annual Symposium on Combinatorial Search, 2012

Faster Bounded-Cost Search Using Inadmissible Estimates.

Jordan Tyler Thayer, Roni Stern, Ariel Felner, Wheeler Ruml

Proceedings of the Twenty-Second International Conference on Automated Planning and Scheduling, 2012

2011

Deadline-Aware Search Using On-Line Measures of Behavior.

Austin J. Dionne, Jordan Tyler Thayer, Wheeler Ruml

Proceedings of the Fourth Annual Symposium on Combinatorial Search, 2011

Bounded Suboptimal Search: A Direct Approach Using Inadmissible Estimates.

Jordan Tyler Thayer, Wheeler Ruml

Proceedings of the IJCAI 2011, 2011

Heuristic Search under Quality and Time Bounds.

Jordan Tyler Thayer

Proceedings of the IJCAI 2011, 2011

Learning Inadmissible Heuristics During Search.

Jordan Tyler Thayer, Austin J. Dionne, Wheeler Ruml

Proceedings of the 21st International Conference on Automated Planning and Scheduling, 2011

2010

A Comparison of Greedy Search Algorithms.

Christopher Makoto Wilt, Jordan Tyler Thayer, Wheeler Ruml

Proceedings of the Third Annual Symposium on Combinatorial Search, 2010

Anytime Heuristic Search: Frameworks and Algorithms.

Jordan Tyler Thayer, Wheeler Ruml

Proceedings of the Third Annual Symposium on Combinatorial Search, 2010

Finding Acceptable Solutions Faster Using Inadmissible Information.

Jordan Tyler Thayer, Wheeler Ruml

Proceedings of the Third Annual Symposium on Combinatorial Search, 2010

The Joy of Forgetting: Faster Anytime Search via Restarting.

Silvia Richter, Jordan Tyler Thayer, Wheeler Ruml

Proceedings of the 20th International Conference on Automated Planning and Scheduling, 2010

2009

Using Distance Estimates in Heuristic Search.

Jordan Tyler Thayer, Wheeler Ruml

Proceedings of the 19th International Conference on Automated Planning and Scheduling, 2009

2008

Faster than Weighted A*: An Optimistic Approach to Bounded Suboptimal Search.

Jordan Tyler Thayer, Wheeler Ruml

Proceedings of the Eighteenth International Conference on Automated Planning and Scheduling, 2008