Choosing preemption points to minimize typical running times.

Sanjoy K. Baruah Nathan Fisher

Published in: RTNS (2019)

Keyphrases

running times
times faster
lower bound
worst case
point sets
real world
neural network
artificial intelligence
social networks
artificial neural networks
convex hull
data points
upper bound
feature points
medial axis
endpoints
special case
database
decision trees
machine learning
data sets
real time