2147 search results - page 293 / 430 » Evolutionary Algorithms |
169
click to vote
GECCO
2009
Springer
16 years 28 days ago
2009
Springer
In this paper we propose to use a distance metric based on user-preferences to efficiently find solutions for manyobjective problems. We use a particle swarm optimization (PSO) a...
171
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
Capability planning problems are pervasive throughout many areas of human interest with prominent examples found in defense and security. Planning provides a unique context for op...
150
click to vote
WABI
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. We present two algorithms for computing the quartet distance between trees of arbitrary degree. The quartet distance between two unrooted evolutionary trees is the number...
176
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approach...
183
click to vote
ICMCS
2007
IEEE
16 years 18 days ago
2007
IEEE
Query reformulation has been suggested as an effective way to improve retrieval efficiency in text information retrieval and one of the well-known techniques for query reformulati...