Sciweavers

94 search results - page 11 / 19
» Approximating covering problems by randomized search heurist...
Sort
View
87
Voted
GECCO
2010
Springer
176views Optimization» more  GECCO 2010»
15 years 1 months ago
A hierarchical cooperative evolutionary algorithm
To successfully search multiple coadaptive subcomponents in a solution, we developed a novel cooperative evolutionary algorithm based on a new computational multilevel selection f...
Shelly Xiaonan Wu, Wolfgang Banzhaf
WSC
1997
15 years 28 days ago
Searching for Important Factors: Sequential Bifurcation under Uncertainty
The problem of searching for important factors in a simulation model is considered when the simulation output is subject to stochastic variation. Bettonvil and Kleijnen (1996) giv...
Russell C. H. Cheng
MIA
2010
170views more  MIA 2010»
14 years 6 months ago
Linear intensity-based image registration by Markov random fields and discrete optimization
We propose a framework for intensity-based registration of images by linear transformations, based on a discrete Markov Random Field (MRF) formulation. Here, the challenge arises ...
Darko Zikic, Ben Glocker, Oliver Kutter, Martin Gr...
SPIRE
2010
Springer
14 years 10 months ago
Hypergeometric Language Model and Zipf-Like Scoring Function for Web Document Similarity Retrieval
The retrieval of similar documents in the Web from a given document is different in many aspects from information retrieval based on queries generated by regular search engine use...
Felipe Bravo-Marquez, Gaston L'Huillier, Sebasti&a...
WSC
2004
15 years 29 days ago
Stochastic Approximation with Simulated Annealing as an Approach to Global Discrete-Event Simulation Optimization
This paper explores an approach to global, stochastic, simulation optimization which combines stochastic approximation (SA) with simulated annealing (SAN). SA directs a search of ...
Matthew H. Jones, K. Preston White