Sciweavers

376 search results - page 60 / 76
» Feedback-Directed Random Test Generation
Sort
View
GECCO
2009
Springer
14 years 12 days ago
The sensitivity of HyperNEAT to different geometric representations of a problem
HyperNEAT, a generative encoding for evolving artificial neural networks (ANNs), has the unique and powerful ability to exploit the geometry of a problem (e.g., symmetries) by enc...
Jeff Clune, Charles Ofria, Robert T. Pennock
BMCBI
2010
154views more  BMCBI 2010»
13 years 8 months ago
An algorithm for automated closure during assembly
Background: Finishing is the process of improving the quality and utility of draft genome sequences generated by shotgun sequencing and computational assembly. Finishing can invol...
Sergey Koren, Jason R. Miller, Brian Walenz, Grang...
CIDM
2009
IEEE
14 years 2 months ago
Ensemble member selection using multi-objective optimization
— Both theory and a wealth of empirical studies have established that ensembles are more accurate than single predictive models. Unfortunately, the problem of how to maximize ens...
Tuve Löfström, Ulf Johansson, Henrik Bos...
COR
2000
129views more  COR 2000»
13 years 7 months ago
Heuristics for the multi-vehicle covering tour problem
The multi-vehicle covering tour problem is de"ned on a graph G"(<6=, E), where = is a set of vertices that must collectively be covered by up to m vehicles. The probl...
Mondher Hachicha, M. John Hodgson, Gilbert Laporte...
JAR
2000
145views more  JAR 2000»
13 years 7 months ago
Logical Cryptanalysis as a SAT Problem
Cryptographic algorithms play a key role in computer security and the formal analysis of their robustness is of utmost importance. Yet, logic and automated reasoning tools are seld...
Fabio Massacci, Laura Marraro