3946 search results - page 488 / 790 » The computational complexity of choice sets |
163
click to vote
CEC
2005
IEEE
16 years 12 days ago
2005
IEEE
AbstractInteractive evolutionary algorithms (IEA) often suffer from what is called the “user bottleneck.” In this paper, we propose and analyse a method to limit the user inter...
173
click to vote
CEC
2005
IEEE
16 years 12 days ago
2005
IEEE
Abstract- Sequential parameter optimization is a heuristic that combines classical and modern statistical techniques to improve the performance of search algorithms. To demonstrate...
170
Voted
DIS
2005
Springer
16 years 9 days ago
2005
Springer
We consider the problem of discovering the optimal pattern from a set of strings and associated numeric attribute values. The goodness of a pattern is measured by the correlation b...
151
click to vote
ICALP
2005
Springer
16 years 8 days ago
2005
Springer
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is ...
171
click to vote
ICANN
2005
Springer
16 years 8 days ago
2005
Springer
Abstract. The paper presents a new version of a GMDH type algorithm able to perform an automatic model structure synthesis, robust model parameter estimation and model validation i...