4075 search results - page 462 / 815 » Modeling Distributed Algorithm Using B |
173
click to vote
HPDC
1999
IEEE
15 years 11 months ago
1999
IEEE
Efficient and robust metacomputing requires the decomposition of complex jobs into tasks that must be scheduled on distributed processing nodes. There are various ways of creating...
180
click to vote
SAC
2010
ACM
16 years 1 months ago
2010
ACM
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...
207
Voted
ICPADS
1994
IEEE
15 years 11 months ago
1994
IEEE
Testingthe performance scalabilityof parallelprograms can be a time consuming task, involving many performance runs for different computer configurations, processor numbers, and p...
166
click to vote
ECCV
2002
Springer
16 years 8 months ago
2002
Springer
Many approaches have been proposed to locate faces in an image. There are, however, two problems in previous facial shape models using feature points. First, the dimension of the s...
188
click to vote
DAC
2010
ACM
15 years 10 months ago
2010
ACM
We propose a parallel global routing algorithm that concurrently processes routing subproblems corresponding to rectangular subregions covering the chip area. The algorithm uses a...