Sciweavers

1612 search results - page 291 / 323
» Analysing Randomized Distributed Algorithms
Sort
View
GECCO
2011
Springer
248views Optimization» more  GECCO 2011»
13 years 4 hour ago
Size-based tournaments for node selection
In genetic programming, the reproductive operators of crossover and mutation both require the selection of nodes from the reproducing individuals. Both unbiased random selection a...
Thomas Helmuth, Lee Spector, Brian Martin
JMLR
2012
11 years 11 months ago
Learning Low-order Models for Enforcing High-order Statistics
Models such as pairwise conditional random fields (CRFs) are extremely popular in computer vision and various other machine learning disciplines. However, they have limited expre...
Patrick Pletscher, Pushmeet Kohli
ICS
2009
Tsinghua U.
14 years 1 months ago
Exploring pattern-aware routing in generalized fat tree networks
New static source routing algorithms for High Performance Computing (HPC) are presented in this work. The target parallel architectures are based on the commonly used fattree netw...
Germán Rodríguez, Ramón Beivi...
BMCBI
2010
198views more  BMCBI 2010»
13 years 8 months ago
ClustalXeed: a GUI-based grid computation version for high performance and terabyte size multiple sequence alignment
Background: There is an increasing demand to assemble and align large-scale biological sequence data sets. The commonly used multiple sequence alignment programs are still limited...
Taeho Kim, Hyun Joo
ALGORITHMICA
1998
73views more  ALGORITHMICA 1998»
13 years 8 months ago
Linear Probing and Graphs
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
Donald E. Knuth