Sciweavers

381 search results - page 46 / 77
» Time Complexity of genetic algorithms on exponentially scale...
Sort
View
FPGA
2004
ACM
174views FPGA» more  FPGA 2004»
14 years 1 months ago
A compiled accelerator for biological cell signaling simulations
The simulation of large systems of biochemical reactions is a key part of research into molecular signaling and information processing in biological cells. However, it can be impr...
John F. Keane, Christopher Bradley, Carl Ebeling
CORR
2007
Springer
106views Education» more  CORR 2007»
13 years 7 months ago
Bandit Algorithms for Tree Search
Bandit based methods for tree search have recently gained popularity when applied to huge trees, e.g. in the game of go [6]. Their efficient exploration of the tree enables to ret...
Pierre-Arnaud Coquelin, Rémi Munos
ISSTA
2004
ACM
14 years 1 months ago
Evolutionary testing in the presence of loop-assigned flags: a testability transformation approach
Evolutionary testing is an effective technique for automatically generating good quality test data. However, for structural testing, the technique degenerates to random testing i...
André Baresel, David Binkley, Mark Harman, ...
GECCO
2007
Springer
150views Optimization» more  GECCO 2007»
13 years 11 months ago
Overcoming hierarchical difficulty by hill-climbing the building block structure
The Building Block Hypothesis suggests that Genetic Algorithms (GAs) are well-suited for hierarchical problems, where efficient solving requires proper problem decomposition and a...
David Iclanzan, Dan Dumitrescu
AAAI
2011
12 years 7 months ago
Stopping Rules for Randomized Greedy Triangulation Schemes
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...
Andrew Gelfand, Kalev Kask, Rina Dechter