Timothy Highley
Timothy Highley
Verified email at
Cited by
Cited by
Toward realizable restricted delegation in computational grids
G Stoker, BS White, E Stackpole, T Highley, M Humphrey
International Conference on High-Performance Computing and Networking, 32-41, 2001
Discrete mathematics assessment using learning objectives based on Bloom's taxonomy
T Highley, AE Edlin
2009 39th IEEE Frontiers in Education Conference, 1-6, 2009
Aspect Oriented Programming-A Critical Analysis of a new Programming Paradigm
TJ Highley, M Lack, P Myers
Technical Report CS-99-29 5, 1999
Marginal Cost-Benefit Analysis for Predictive File Prefetching
T Highley, P Reynolds
41st Annual ACM Southeast Conference (ACMSE 2003), 2003
Empirical analysis of case-editing approaches for numeric prediction
MA Redmond, T Highley
Innovations in Computing Sciences and Software Engineering, 79-84, 2010
The first international competition in machine reconnaissance blind chess
RW Gardner, C Lowman, C Richardson, AJ Llorens, J Markowitz, ...
NeurIPS 2019 Competition and Demonstration Track, 121-130, 2020
Dealing with uncertainty: A piecewisegrid agent for reconnaissance blind chess
T Highley, B Funk, L Okin
Journal of Computing Sciences in Colleges 35 (8), 156-165, 2020
Checkpoint variations for deep q-learning in reconnaissance blind chess
K Blowitski, T Highley
Journal of Computing Sciences in Colleges 37 (3), 81-88, 2021
Absolute Cost-Benefit Analysis for Predictive File Prefetching
T Highley, PF Reynolds, V Vellanki
AggPro: the aggregate projection system
R Gore, C Snapp, T Highley
Baseball Research Journal 38 (2), 20-25, 2009
Granularity of weighted averages and use of rate statistics in AggPro
T Highley, R Gore, C Snapp
Proceedings of the 2010 Winter Simulation Conference, 1318-1329, 2010
Scalable personalized learning
PF Reynolds, C Milner, T Highley
34th Annual Frontiers in Education, 2004. FIE 2004., S3H/3-S3H/8 Vol. 3, 2004
Using Information Structure Design to Reduce Bribery
T Highley, K Demesie
Journal of Computing Sciences in Colleges 38 (3), 76-85, 2022
Tropical Vertex-Disjoint Cycles of a Vertex-Colored Digraph: Barter Exchange with Multiple Items Per Agent
T Highley, H Le
Discrete Mathematics & Theoretical Computer Science 20, 2018
Tropical Vertex-Disjoint Cycles of a Vertex-Colored Digraph is NP-Complete
T Highley
arXiv preprint arXiv:1610.05115, 2016
An approach to the fairy tale card game: a rotating sets competitive knapsack problem with strongly stochastic rewards and item availability
C Schumann, T Highley, H Stickley
Journal of Computing Sciences in Colleges 30 (3), 16-25, 2015
Prefetching Over Heterogeneous Channels of Communication
PF Reynolds Jr, TL Highley Jr
Fourth IASTED International Conference on Communications, Internet, and …, 2006
Enhanced file prefetching for delivery on demand
TL Highley Jr
University of Virginia, 2005
Testing the Functional Requirements of the Switch Interface Unit
T Highley, P Reynolds, C Williams
University of Virginia, 2000
The system can't perform the operation now. Try again later.
Articles 1–19