This paper examines the behavioral phenomena that occur with the tuning of the binomial-3 problem. Our analysis identifies a distinct set of phenomena that may be generalizable to...
Omer A. Chaudhri, Jason M. Daida, Jonathan C. Khoo...
We consider the problem minX{0,1}n {c x : aj x bj , j = 1, . . . , m}, where the aj are random vectors with unknown distributions. The only information we are given regarding the ...
We present a new technique, failure-oblivious computing, that enables servers to execute through memory errors without memory corruption. Our safe compiler for C inserts checks th...
Martin C. Rinard, Cristian Cadar, Daniel Dumitran,...
This paper proposes a lightweight fusion method for general recursive function definitions. Compared with existing proposals, our method has several significant practical features...
Calling context--the set of active methods on the stack--is critical for understanding the dynamic behavior of large programs. Dynamic program analysis tools, however, are almost ...