Timothy Highley

According to our database, Timothy Highley authored at least 9 papers between 2009 and 2022.

Collaborative distances:

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

2022

Using Information Structure Design to Reduce Bribery.

Timothy Highley, Kidanewold Demesie

J. Comput. Sci. Coll., 2022

2021

Checkpoint variations for deep Q-learning in reconnaissance blind chess.

Kyle Blowitski, Timothy Highley

J. Comput. Sci. Coll., 2021

2020

Dealing with uncertainty: a PiecewiseGrid agent for reconnaissance blind chess.

Timothy Highley, Brendan Funk, Laureen Okin

J. Comput. Sci. Coll., 2020

2019

The First International Competition in Machine Reconnaissance Blind Chess.

Ryan W. Gardner, Corey Lowman, Casey Richardson, Ashley J. Llorens, Jared Markowitz, Nathan Drenkow, Andrew Newman, Gregory Clark, Gino Perrotta, Robert Perrotta, Timothy Highley, Vlad Shcherbina, William Bernadoni, Mark Jordan, Asen Asenov

Proceedings of the NeurIPS 2019 Competition and Demonstration Track, 2019

2018

Tropical Vertex-Disjoint Cycles of a Vertex-Colored Digraph: Barter Exchange with Multiple Items Per Agent.

Timothy Highley, Hoang Le

Discret. Math. Theor. Comput. Sci., 2018

2016

Tropical Vertex-Disjoint Cycles of a Vertex-Colored Digraph (TROPICAL EXCHANGE) is NP-Complete.

Timothy Highley

CoRR, 2016

2015

An approach to the fairy tale card game: a rotating sets competitive knapsack problem with strongly stochastic rewards and item availability.

Candice Schumann, Timothy Highley, Howard Stickley

J. Comput. Sci. Coll., 2015

2010

Granularity of weighted averages and use of rate statistics in AggPro.

Timothy Highley, Ross Gore, Cameron Snapp

Proceedings of the 2010 Winter Simulation Conference, 2010

2009

Empirical Analysis of Case-Editing Approaches for Numeric Prediction.

Michael A. Redmond, Timothy Highley

Proceedings of the Innovations in Computing Sciences and Software Engineering, 2009