882 search results - page 172 / 177 » On the Hardness of Graph Isomorphism |
GECCO
2009
Springer
14 years 2 days ago
2009
Springer
Encouraging exploration, typically by preserving the diversity within the population, is one of the most common method to improve the behavior of evolutionary algorithms with dece...
ESSLLI
1999
Springer
13 years 11 months ago
1999
Springer
This paper presents a grammar formalism in which constituent graphs are unions of a continuous surface tree and a discontinuous deep tree. The formalism has an object-oriented desi...
EPS
1998
Springer
13 years 11 months ago
1998
Springer
This paper discusses a simple representation of variable-dimensional optimization problems for evolutionary algorithms. Although it was successfully applied to the optimization of ...
KDD
2010
ACM
13 years 11 months ago
2010
ACM
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
CIKM
2006
Springer
13 years 11 months ago
2006
Springer
Web page classification is important to many tasks in information retrieval and web mining. However, applying traditional textual classifiers on web data often produces unsatisfyi...