Sciweavers

2393 search results - page 180 / 479
» Bounds-Consistent Local Search
Sort
View
MICRO
1990
IEEE
147views Hardware» more  MICRO 1990»
15 years 7 months ago
Motivation and framework for using genetic algorithms for microcode compaction
Genetic algorithms are a robust adaptive optimization technique based on a biological paradigm. They perform efficient search on poorly-defined spaces by maintaining an ordered po...
Steven J. Beaty, Darrell Whitley, Gearold Johnson
111
Voted
ECAI
2006
Springer
15 years 7 months ago
Random Subset Optimization
Some of the most successful algorithms for satisfiability, such as Walksat, are based on random walks. Similarly, local search algorithms for solving constraint optimization proble...
Boi Faltings, Quang Huy Nguyen
149
Voted
UAI
2008
15 years 4 months ago
Improving Gradient Estimation by Incorporating Sensor Data
An efficient policy search algorithm should estimate the local gradient of the objective function, with respect to the policy parameters, from as few trials as possible. Whereas m...
Gregory Lawrence, Stuart J. Russell
132
Voted
ECAI
2010
Springer
15 years 4 months ago
Nested Monte-Carlo Expression Discovery
Nested Monte-Carlo search is a general algorithm that gives good results in single player games. Genetic Programming evaluates and combines trees to discover expressions that maxim...
Tristan Cazenave
PRL
2010
159views more  PRL 2010»
15 years 1 months ago
Creating diverse nearest-neighbour ensembles using simultaneous metaheuristic feature selection
The nearest-neighbour (1NN) classifier has long been used in pattern recognition, exploratory data analysis, and data mining problems. A vital consideration in obtaining good res...
Muhammad Atif Tahir, Jim E. Smith