This paper considers the problem of electing an eventual leader in an asynchronous shared memory system. While this problem has received a lot of attention in messagepassing syste...
This paper presents improved approximation algorithms for the problem of multiprocessor scheduling under uncertainty (SUU), in which the execution of each job may fail probabilist...
Christopher Y. Crutchfield, Zoran Dzunic, Jeremy T...
: Even if Multiagent Systems (MASs) are recognised as an appealing paradigm for designing many computer systems ranging from complex distributed systems to intelligent software app...
Vincent Hilaire, Pablo Gruer, Abderrafiaa Koukam, ...
We consider the problem of transforming a given sequential implementation of a data structure into a wait-free concurrent implementation. Given the code for different operations ...
We present the GeoStar project at RPI, which researches various terrain (i.e., elevation) representations and operations thereon. This work is motivated by the large amounts of hi...
W. Randolph Franklin, Metin Inanc, Zhongyi Xie, Da...