4075 search results - page 46 / 815 » Modeling Distributed Algorithm Using B |
SAC
2006
ACM
14 years 3 months ago
2006
ACM
In this paper, we present an efficient procedure for building a piecewise linear function approximation of the speed function of a processor with hierarchical memory structure. Th...
ICMCS
1997
IEEE
14 years 1 months ago
1997
IEEE
An important concept in the available bit rate (ABR) service model as defined by the ATM Forum is the minimum cell rate (MCR) guarantee as well as the peak cell rate (PCR) constra...
UAI
2001
13 years 10 months ago
2001
We present a general framework for defining priors on model structure and sampling from the posterior using the Metropolis-Hastings algorithm. The key ideas are that structure pri...
JPDC
2007
13 years 9 months ago
2007
High quality of security is increasingly critical for applications running on heterogeneous distributed systems. However, existing scheduling algorithms for heterogeneous distribu...
PARLE
1991
14 years 20 days ago
1991
It is shown that the terminationdetection problem for distributed computations can be modeled as an instance of the garbage collection problem. Consequently, algorithms for the te...