Sciweavers

3862 search results - page 435 / 773
» Adaptive Noisy Optimization
Sort
View
GECCO
2008
Springer
157views Optimization» more  GECCO 2008»
15 years 7 months ago
Self-adaptive mutation rates in genetic algorithm for inverse design of cellular automata
Self-adaptation is used a lot in Evolutionary Strategies and with great success, yet for some reason it is not the mutation adaptation of choice for Genetic Algorithms. This poste...
Ron Breukelaar, Thomas Bäck
EOR
2010
116views more  EOR 2010»
15 years 6 months ago
Speeding up continuous GRASP
Continuous GRASP (C-GRASP) is a stochastic local search metaheuristic for finding cost-efficient solutions to continuous global optimization problems subject to box constraints (Hi...
Michael J. Hirsch, Panos M. Pardalos, Mauricio G. ...
IPM
2006
167views more  IPM 2006»
15 years 6 months ago
Browsing mixed structured and unstructured data
Both structured and unstructured data, as well as structured data representing several different types of tuples, may be integrated into a single list for browsing or retrieval. D...
Robert M. Losee
TSP
2008
144views more  TSP 2008»
15 years 6 months ago
A New Robust Variable Step-Size NLMS Algorithm
A new framework for designing robust adaptive filters is introduced. It is based on the optimization of a certain cost function subject to a time-dependent constraint on the norm o...
Leonardo Rey Vega, Hernan Rey, Jacob Benesty, Sara...
HEURISTICS
1998
103views more  HEURISTICS 1998»
15 years 6 months ago
Computing Approximate Solutions of the Maximum Covering Problem with GRASP
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
Mauricio G. C. Resende