43264 search results - page 361 / 8653 » Comparing models of computation |
142
click to vote
GECCO
2007
Springer
15 years 11 months ago
2007
Springer
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
129
click to vote
LCPC
2007
Springer
15 years 11 months ago
2007
Springer
The OpenMP standard was conceived to parallelize dense array-based applications, and it has achieved much success with that. Recently, a novel tasking proposal to handle unstructur...
145
click to vote
3DIM
2005
IEEE
15 years 10 months ago
2005
IEEE
The computational cost of a collision detection (CD) algorithm on polygonal surfaces depends highly on the complexity of the models. A novel “locally refined” approach is intr...
149
click to vote
PPAM
2005
Springer
15 years 10 months ago
2005
Springer
Algorithms for the sparse matrix-vector multiplication (shortly SpM×V ) are important building blocks in solvers of sparse systems of linear equations. Due to matrix sparsity, the...
147
click to vote
DATE
2010
IEEE
15 years 9 months ago
2010
IEEE
—With every process generation, the problem of variability in physical parameters and environmental conditions poses a great challenge to the design of fast and reliable circuits...