5316 search results - page 222 / 1064 » Which Search Problems Are Random |
118
click to vote
EVOW
2006
Springer
15 years 8 months ago
2006
Springer
This paper proposes an evolutionary algorithm (EA) that is applied to the traveling salesman problem (TSP). Existing approximation methods to address the TSP known to be state-of-t...
124
click to vote
JUCS
2008
15 years 4 months ago
2008
: In this paper we propose a new approach to Swarm Intelligence called Two-Step Swarm Intelligence. The basic idea is to split the heuristic search performed by agents into two sta...
130
click to vote
SDM
2009
SIAM
16 years 1 months ago
2009
SIAM
Metaheuristics represent an important class of techniques to solve, approximately, hard combinatorial optimization problems for which the use of exact methods is impractical. In t...
137
click to vote
ISMIS
1999
Springer
15 years 8 months ago
1999
Springer
Knowledge Discovery in Databases (KDD) is a data analysis process which, in contrast to conventional data analysis, automatically generates and evaluates very many hypotheses, deal...
142
click to vote
CEC
2007
IEEE
15 years 11 months ago
2007
IEEE
Abstract— For the past decade or so, evolutionary multiobjective optimization (EMO) methodologies have earned wide popularity for solving complex practical optimization problems,...