We obtain analytically the delay per packet in a burst for the three burst aggregation algorithms: Time based, Burst Length based and mixed Time and Burst Length based, assuming r...
In this paper we develop a methodology for defining stopping rules in a general class of global random search algorithms that are based on the use of statistical procedures. To bu...
Typically there is a high coherence in data values between neighboring time steps in an iterative scientific software simulation; this characteristic similarly contributes to a co...
Jinzhu Gao, Han-Wei Shen, Jian Huang, James Arthur...
: In many computer vision classification problems, both the error and time characterizes the quality of a decision. We show that such problems can be formalized in the framework of...
Just-in-time (JIT) compilation has been used in many applications to enable standard software binaries to execute on different underlying processor architectures. We previously in...