2137 search results - page 372 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
110
click to vote
GECCO
2008
Springer
15 years 3 months ago
2008
Springer
A well-designed fitness function is essential to the effectiveness and efficiency of evolutionary testing. Fitness function design has been researched extensively. For fitness ...
154
click to vote
ASIAMS
2007
IEEE
15 years 8 months ago
2007
IEEE
This talk has two parts explaining the significance of Rough sets in granular computing in terms of rough set rules and in uncertainty handling in terms of lower and upper approxi...
94
Voted
GECCO
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. A hybrid network of evolutionary processors consists of several processors which are placed in nodes of a virtual graph and can perform one simple operation only on the w...
115
Voted
GD
2005
Springer
15 years 7 months ago
2005
Springer
Most diagram editors and graph construction tools provide some form of automatic connector routing, typically providing orthogonal or poly-line connectors. Usually the editor provi...
112
click to vote
AAAI
2010
15 years 3 months ago
2010
Dominance testing, the problem of determining whether an outcome is preferred over another, is of fundamental importance in many applications. Hence, there is a need for algorithm...