Byzantine consensus in asynchronous message-passing systems has been shown to require at least 3f + 1 processes to be solvable in several system models (e.g., with failure detecto...
Miguel Correia, Giuliana Santos Veronese, Lau Cheu...
The advent of tagging and folksonomies for organizing shared resources on the social Web brought promising opportunities to help communities of users capture their knowledge. Howe...
This paper presents the CQ algorithm which decomposes and solves a Markov Decision Process (MDP) by automatically generating a hierarchy of smaller MDPs using state variables. The ...
Structure analysis of table form documents is an important issue because a printed document and even an electronic document do not provide logical structural information but merely...
Cooperative computing is becoming inevitable with the emerging of service-oriented computing and GRID becoming a ubiquitous computing resource. It is widely recognized that agent t...