Sciweavers

116 search results - page 14 / 24
» Parallel heuristic search in Haskell
Sort
View
GECCO
2007
Springer
201views Optimization» more  GECCO 2007»
14 years 2 months ago
A parallel framework for loopy belief propagation
There are many innovative proposals introduced in the literature under the evolutionary computation field, from which estimation of distribution algorithms (EDAs) is one of them....
Alexander Mendiburu, Roberto Santana, Jose Antonio...
SIGMOD
2012
ACM
253views Database» more  SIGMOD 2012»
11 years 11 months ago
Skew-aware automatic database partitioning in shared-nothing, parallel OLTP systems
The advent of affordable, shared-nothing computing systems portends a new class of parallel database management systems (DBMS) for on-line transaction processing (OLTP) applicatio...
Andrew Pavlo, Carlo Curino, Stanley B. Zdonik
GECCO
2005
Springer
140views Optimization» more  GECCO 2005»
14 years 2 months ago
Isolating the benefits of respect
The three mechanisms of crossover are transmission, assortment, and respect. Of these three mechanisms, assortment (i.e. recombination) is traditionally viewed as the primary feat...
Stephen Chen, Gregory Pitt
BMCBI
2010
122views more  BMCBI 2010»
13 years 8 months ago
Fast and accurate protein substructure searching with simulated annealing and GPUs
Background: Searching a database of protein structures for matches to a query structure, or occurrences of a structural motif, is an important task in structural biology and bioin...
Alex Stivala, Peter J. Stuckey, Anthony Wirth
BMCBI
2011
13 years 5 days ago
Faster Smith-Waterman database searches with inter-sequence SIMD parallelisation
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...
Torbjørn Rognes