575 search results - page 32 / 115 » Computing Maximum Subsequence in Parallel |
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
The Cross Entropy algorithm is a new search method for combinatorial problem. However, it needs considerable computational time to achieve good solution quality. To make the Cross...
IEEEPACT
2008
IEEE
14 years 2 months ago
2008
IEEE
We present a novel mechanism, called meeting point thread characterization, to dynamically detect critical threads in a parallel region. We define the critical thread the one with...
APIN
1999
13 years 7 months ago
1999
We present a method for mapping a given Bayesian network to a Boltzmann machine architecture, in the sense that the the updating process of the resulting Boltzmann machine model pr...
IPPS
2010
IEEE
13 years 5 months ago
2010
IEEE
From the point of view of an operating system, a computer is managed and optimized in terms of the application programming model and the management of system resources. For the TF...
CCECE
2006
IEEE
14 years 1 months ago
2006
IEEE
During recent years there has been an explosive growth of biological data coming from genome projects, proteomics, protein structure determination, and the rapid expansion in digi...