95 search results - page 15 / 19 » Approximation of Natural W[P]-Complete Minimisation Problems... |
RECOMB
2004
Springer
14 years 7 months ago
2004
Springer
In nature, one finds large collections of different protein sequences exhibiting roughly the same three-dimensional structure, and this observation underpins the study of structur...
GECCO
2008
Springer
13 years 7 months ago
2008
Springer
Based in part on observations about the incremental nature of most state changes in biological systems, we introduce the idea of Memory with Memory in Genetic Programming (GP), wh...
PKDD
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. Polytope Faces Pursuit (PFP) is a greedy algorithm that approximates the sparse solutions recovered by 1 regularised least-squares (Lasso) [4,10] in a similar vein to (Or...
ICDT
2009
ACM
14 years 7 months ago
2009
ACM
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
PPSN
2000
Springer
13 years 10 months ago
2000
Springer
Abstract. We explore a new general-purpose heuristic for nding highquality solutions to hard optimization problems. The method, called extremal optimization, is inspired by self-or...