9842 search results - page 331 / 1969 » Problem complexity |
197
click to vote
GECCO
2005
Springer
16 years 10 days ago
2005
Springer
This paper presents the Real-coded Genetic Algorithms for high-dimensional ill-scaled structures, what is called, the ktablet structure. The k-tablet structure is the landscape th...
177
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
Hyper-heuristics can be thought of as “heuristics to choose heuristics”. They are concerned with adaptively finding solution methods, rather than directly producing a solutio...
174
click to vote
OOIS
1994
Springer
15 years 11 months ago
1994
Springer
The business of software development is solving problems. Following Polya, we can increase our ability to solve problems by focusing directly on problems themselves, on their part...
225
click to vote
STOC
2000
ACM
15 years 11 months ago
2000
ACM
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
201
click to vote
SODA
1992
ACM
15 years 8 months ago
1992
ACM
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...