This paper presents the results of an exploratory experiment investigating the use of program metrics to predict reachability graph size, reachability graph generation time, and d...
Performance of generic array programs crucially relies on program specialization wrt. shape information. Traditionally, this is done in a rather adhoc fashion by propagating all sh...
Clemens Grelck, Sven-Bodo Scholz, Alexander V. Sha...
Many interesting problems, such as power grids, network switches, and tra c ow, that are candidates for solving with reinforcement learningRL, alsohave properties that make distri...
Jeff G. Schneider, Weng-Keen Wong, Andrew W. Moore...
Dyadic data matrices, such as co-occurrence matrix, rating matrix, and proximity matrix, arise frequently in various important applications. A fundamental problem in dyadic data a...
Abstract. Every running thread has its own thread context that consists of values of the fields of the target thread object. To consider the thread context in understanding the be...