Sciweavers

3 search results - page 1 / 1
» Overcoming hierarchical difficulty by hill-climbing the buil...
Sort
View
GECCO
2007
Springer
150views Optimization» more  GECCO 2007»
13 years 8 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
IJKDB
2010
162views more  IJKDB 2010»
13 years 1 months ago
New Trends in Graph Mining: Structural and Node-Colored Network Motifs
Searching for repeated features characterizing biological data is fundamental in computational biology. When biological networks are under analysis, the presence of repeated modul...
Francesco Bruno, Luigi Palopoli, Simona E. Rombo
DEDS
2002
119views more  DEDS 2002»
13 years 4 months ago
Diagnosing Discrete-Event Systems: Extending the "Diagnoser Approach" to Deal with Telecommunication Networks
Abstract. Detection and isolation of failures in large and complex systems such as telecommunication networks are crucial and challenging tasks. The problem considered here is that...
Laurence Rozé, Marie-Odile Cordier