337 search results - page 3 / 68 » Run-Time Methods for Parallelizing Partially Parallel Loops |
119
Voted
PPSN
2010
Springer
15 years 18 days 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...
IPPS
2000
IEEE
15 years 6 months ago
2000
IEEE
In this paper, we present a method to estimate the number of reconfiguration steps that a time-constrained algorithm can accommodate. This analysis demonstrates how one would attac...
185
Voted
PARLE
1994
15 years 5 months ago
1994
Sparse matrix-vector multiplication forms the heart of iterative linear solvers used widely in scientific computations (e.g., finite element methods). In such solvers, the matrix-v...
99
Voted
STOC
2001
ACM
16 years 2 months ago
2001
ACM
Recently Rothemund and Winfree 6] have considered the program size complexity of constructing squares by selfassembly. Here, we consider the time complexity of such constructions ...
142
Voted
RTSS
2006
IEEE
15 years 8 months ago
2006
IEEE
Modern FPGA devices, which include (multiple) processor core(s) as diffused IP on the silicon die, provide an excellent platform for developing custom multiprocessor systems-on-pr...