1534 search results - page 21 / 307 » Stochastic Bounds on Execution Times of Parallel Computation... |
PODC
1993
ACM
13 years 11 months ago
1993
ACM
A counting protocol (mod m) consists of shared memory bits - referred to as the counter - and of a procedure for incrementing the counter value by 1 (mod m). The procedure may be ...
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
Workstation clusters equipped with high performance interconnect having programmable network processors facilitate interesting opportunities to enhance the performance of parallel...
PPSN
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. We present a new method for proving lower bounds in evolutionary computation based on fitness-level arguments and an additional condition on transition probabilities bet...
IEEEPACT
1998
IEEE
13 years 12 months ago
1998
IEEE
In order to achieve practical efficient execution on a parallel architecture, a knowledge of the data dependencies related to the application appears as the key point for building...
BMCBI
2011
13 years 2 months ago
2011
Background: The prediction of the structure of large RNAs remains a particular challenge in bioinformatics, due to the computational complexity and low levels of accuracy of state...