1710 search results - page 111 / 342 » Parallelism in Structured Newton Computations |
102
click to vote
BMCBI
2008
14 years 10 months ago
2008
Background: Expressed sequence tag (EST) collections are composed of a high number of single-pass, redundant, partial sequences, which need to be processed, clustered, and annotat...
102
click to vote
EGH
2010
Springer
14 years 8 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...
IPPS
2007
IEEE
15 years 4 months ago
2007
IEEE
In this paper, we study the problem of an optimal assignment of a tree-structured context reasoning procedure onto the computation resources in a hostsatellites configuration. The...
CCGRID
2009
IEEE
15 years 4 months ago
2009
IEEE
This paper presents “Self-Chord”, a bio-inspired P2P algorithm that can be profitably adopted to build the information service of distributed systems, in particular Computati...
GECCO
2008
Springer
14 years 11 months ago
2008
Springer
This paper empirically investigates parallel competent genetic algorithms (cGAs) [4]. cGAs, such as BOA [21], LINCGA [15], D5 -GA [28], can solve GA-difficult problems by automati...