4075 search results - page 9 / 815 » Modeling Distributed Algorithm Using B |
FC
2005
Springer
14 years 2 months ago
2005
Springer
We suggest a general paradigm of using large-scale distributed computation to solve difficult problems, but where humans can act as agents and provide candidate solutions. We are e...
CDC
2010
IEEE
13 years 4 months ago
2010
IEEE
The expectation maximisation (EM) algorithm has proven to be effective for a range of identification problems. Unfortunately, the way in which the EM algorithm has previously been ...
ICDCS
2006
IEEE
14 years 3 months ago
2006
IEEE
This paper presents a design and analysis of scheduling techniques to cope with the inherent unreliability and instability of worker nodes in large-scale donation-based distribute...
ENTCS
2007
13 years 9 months ago
2007
The event B method provides a general framework for modelling both data structures and algorithms. B models are validated by discharging proof obligations ensuring safety properti...
EUROPAR
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. To establish lower bounds on the amount of replication, there is a common partition argument used to construct indistinguishable executions such that one violates some pr...