1119 search results - page 132 / 224 » Computing in the Presence of Timing Failures |
PODC
2006
ACM
14 years 1 months ago
2006
ACM
Byzantine agreement algorithms typically assume implicit initial state consistency and synchronization among the correct nodes and then operate in coordinated rounds of informatio...
EUROPAR
2001
Springer
14 years 7 days ago
2001
Springer
This paper is on the construction of a server subsystem in a client/server system in an application context where the number of potential clients can be arbitrarily large. The imp...
IPPS
2002
IEEE
14 years 20 days ago
2002
IEEE
Most current work in data mining assumes that the database is static, and a database update requires rediscovering all the patterns by scanning the entire old and new database. Su...
BMCBI
2008
13 years 7 months ago
2008
Background: Simulating the major molecular events inside an Escherichia coli cell can lead to a very large number of reactions that compose its overall behaviour. Not only should ...
ATAL
2008
Springer
13 years 9 months ago
2008
Springer
In this paper, we develop a novel algorithm that allows service consumer agents to automatically select and provision service provider agents for their workflows in highly dynamic...