Sciweavers

6095 search results - page 371 / 1219
» Learning in Local Search
Sort
View
179
Voted
SSIAI
2000
IEEE
15 years 11 months ago
Hybrid Hidden Markov Model for Face Recognition
In this paper, we introduce a Hybrid Hidden Markov Model (HMM) face recognition system. The proposed system contains a low-complexity 2-D HMM-based face recognition (LC 2D-HMM FR)...
Hisham Othman, Tyseer Aboulnasr
MICRO
1990
IEEE
147views Hardware» more  MICRO 1990»
15 years 10 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
ECAI
2006
Springer
15 years 10 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
ECAI
2010
Springer
15 years 7 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
IPL
2002
119views more  IPL 2002»
15 years 6 months ago
Randomized splay trees: Theoretical and experimental results
Splay trees are self-organizing binary search trees that were introduced by Sleator and Tarjan [12]. In this paper we present a randomized variant of these trees. The new algorith...
Susanne Albers, Marek Karpinski