We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...
Bogdan S. Chlebus, Dariusz R. Kowalski, Michal Str...
Weighted automata are finite automata with numerical weights on transitions. Nondeterministic weighted automata define quantitative languages L that assign to each word w a real ...
Krishnendu Chatterjee, Laurent Doyen, Thomas A. He...
This paper investigates helper threads that improve performance by prefetching data on behalf of an application’s main thread. The focus is data prefetch helper threads that lac...
Patterns, which are based on in-depth practical experience, can be instructing for the design of groupware applications as sociotechnical systems. On the basis of a summary of the...
Thomas Herrmann, Marcel Hoffmann, Isa Jahnke, Andr...
The access patterns of the users of a web-site are traditionally analyzed in order to facilitate the user access to the site's information. In this study, however, a systemat...
Amir M. Zarkesh, Jafar Adibi, Cyrus Shahabi, Reza ...