— Short flow first scheduling (SFF) strategy is effective in obtaining more stringent performance bounds for short flows in Internet. However, previous strict SFF approaches i...
Recently Zagier proved a remarkable q-series identity. We show that this identity can also be proved by modifying Franklin's classical proof of Euler's pentagonal number...
Given a vector of floating-point numbers with exact sum s, we present an algorithm for calculating a faithful rounding of s, i.e. the result is one of the immediate floating-point ...
We present a new class of randomized approximation algorithms for unrelated parallel machine scheduling problems with the average weighted completion time objective. The key idea i...
This design theatre experience explores the use of choreographic improvisation exercises to reflect on the structures of interaction in a mobile, co-located group. The design tech...