2226 search results - page 196 / 446 » Fault-Tolerant Parallel Applications with Dynamic Parallel S... |
IPPS
1997
IEEE
14 years 10 days ago
1997
IEEE
Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these a...
ICCS
2003
Springer
14 years 1 months ago
2003
Springer
Some of the most challenging applications to parallelize scalably are the ones that present a relatively small amount of computation per iteration. Multiple interacting performance...
PDPTA
2000
13 years 9 months ago
2000
Exploiting compile time knowledge to improve memory bandwidth can produce noticeable improvements at run-time [13, 1]. Allocating the data structure [13] to separate memories when...
GEOINFO
2004
13 years 9 months ago
2004
Volume rendering techniques can be very useful in geographical information systems to provide meaningful and visual information about the surface and the interior of 3D datasets. ...
EGH
2010
Springer
13 years 6 months ago
2010
Springer
The k-D tree is a well-studied acceleration data structure for ray tracing. It is used to organize primitives in a scene to allow efficient execution of intersection operations be...