Large-scale donation-based distributed infrastructures need to cope with the inherent unreliability of participant nodes. A widely-used work scheduling technique in such environme...
Krishnaveni Budati, Jason D. Sonnek, Abhishek Chan...
Here we revisit ADOPT-ing and bring two new contributions. One contribution consists of developing variations on the algorithms keeping the improvement in length of chain of causa...
Partitioning constitutes one of the most critical challenges a distributed virtual environment needs to handle and is related to the efficient assignment of the existing entities ...
Christos Bouras, Eri Giannaka, Thrasyvoulos Tsiats...
We propose an advanced visual hull technique to compensate for outliers using reliabilities of the silhouettes. The proposed method consists of a foreground extraction technique b...
Hansung Kim, Ryuuki Sakamoto, Itaru Kitahara, Neal...
—E-limited (or K-limited) scheduling is attractive because its performance is close to that of the exhaustive scheduling which is proven to be the optimal polling scheme for symm...