9842 search results - page 298 / 1969 » The Complexity of the Matching-Cut Problem |
134
Voted
GECCO
2009
Springer
15 years 1 months ago
2009
Springer
Cooperative approaches have proved to be very useful in evolutionary computation due to their ability to solve efficiently high-dimensional complex problems through the cooperatio...
130
click to vote
IEEEICCI
2002
IEEE
15 years 8 months ago
2002
IEEE
In software engineering community there is an increasing effort of design and development of multiagent systems (MAS). Among several issues emerging from this initiative, complexi...
140
Voted
COLT
1995
Springer
15 years 7 months ago
1995
Springer
The Noise Sensitivity Signature (NSS), originally introduced by Grossman and Lapedes (1993), was proposed as an alternative to cross validation for selecting network complexity. I...
130
Voted
ICANN
2009
Springer
15 years 10 months ago
2009
Springer
Model complexity is key concern to any artificial learning system due its critical impact on generalization. However, EC research has only focused phenotype structural complexity ...
111
Voted
CAISE
2007
Springer
15 years 10 months ago
2007
Springer
Semantic matching1 is a fundamental step in implementing data sharing applications. Most systems automating this task however limit themselves to finding simple (one-to-one) match...