4377 search results - page 395 / 876 » Mass problems and randomness |
176
click to vote
AAAI
1996
15 years 8 months ago
1996
GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satis ability and constraint satisfaction problems. We present an improvement to G...
208
click to vote
AAAI
1996
15 years 8 months ago
1996
Procedural representations of control policies have two advantages when facing the scale-up problem in learning tasks. First they are implicit, with potential for inductive genera...
208
click to vote
DAGSTUHL
1996
15 years 8 months ago
1996
We survey results on self-organizing data structures for the search problem and concentrate on two very popular structures: the unsorted linear list, and the binary search tree. Fo...
174
click to vote
EUROGP
2010
Springer
15 years 8 months ago
2010
Springer
We present an analysis of the genotype-phenotype map in Grammatical Evolution (GE). The standard map adopted in GE is a depth-first expansion of the non-terminal symbols during the...
191
click to vote
ICASSP
2010
IEEE
15 years 7 months ago
2010
IEEE
— Ergodic stochastic optimization (ESO) algorithms are proposed to solve resource allocation problems that involve a random state and where optimality criteria are expressed in t...