2147 search results - page 279 / 430 » Evolutionary Algorithms |
177
click to vote
GECCO
2009
Springer
15 years 10 months ago
2009
Springer
When evaluating a heuristic for a combinatorial problem, randomly generated instances of the problem may not provide a thorough exploration of the heuristic's performance, an...
162
click to vote
AAAI
2008
15 years 8 months ago
2008
An important feature of many problem domains in machine learning is their geometry. For example, adjacency relationships, symmetries, and Cartesian coordinates are essential to an...
156
click to vote
CEC
2007
IEEE
16 years 23 days ago
2007
IEEE
Abstract— For solving multimodal problems by means of evolutionary algorithms, one often resorts to multistarts or niching methods. The latter approach the question: ‘What is e...
148
click to vote
GECCO
2005
Springer
15 years 12 months ago
2005
Springer
Evolutionary Algorithms (EAs), popular search methods for solving search and optimization problems, are known for successful and fast location of single optimal solutions. However,...
187
click to vote
AE
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. The graph partitioning problem consists of dividing the vertices of a graph into a set of balanced parts, such that the number of edges connecting vertices in different ...