Sciweavers

1253 search results - page 71 / 251
» Convergence of Evolutionary Algorithms in General Search Spa...
Sort
View
AIPS
2000
15 years 7 months ago
Planning with Incomplete Information as Heuristic Search in Belief Space
The formulation of planning as heuristic search with heuristics derived from problem representations has turned out to be a fruitful approach for classical planning. In this paper...
Blai Bonet, Hector Geffner
MIR
2005
ACM
137views Multimedia» more  MIR 2005»
15 years 12 months ago
Similarity space projection for web image search and annotation
Web image search has been explored and developed in academic as well as commercial areas for over a decade. To measure the similarity between Web images and user queries, most of ...
Ying Liu, Tao Qin, Tie-Yan Liu, Lei Zhang, Wei-Yin...
DAGSTUHL
2006
15 years 7 months ago
How fast does the stationary distribution of the Markov chain modelling EAs concentrate on the homogeneous populations for small
One of the main difficulties faced when analyzing Markov chains modelling evolutionary algorithms is that their cardinality grows quite fast. A reasonable way to deal with this iss...
Boris Mitavskiy, Jonathan E. Rowe
IPPS
2000
IEEE
15 years 10 months ago
Information Exchange in Multi Colony Ant Algorithms
Multi colony ant algorithms are evolutionary optimization heuristics that are well suited for parallel execution. Information exchange between the colonies is an important topic th...
Martin Middendorf, Frank Reischle, Hartmut Schmeck
CEC
2008
IEEE
16 years 22 days ago
A contour method in population-based stochastic algorithms
—Inspired by the contours in topography, this paper proposes a contour method for the population-based stochastic algorithms to solve the problems with continuous variables. Rely...
Ying Lin, Jun Zhang, Lu-kai Lan