1289 search results - page 190 / 258 » Complexity of Counting the Optimal Solutions |
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
This paper introduces a novel analogy with the way in which honeybee colonies operate in order to solve the problem of sparse and quasi dense reconstruction. To successfully solve...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
Evolutionary algorithms tend to produce solutions that are not evolvable: Although current fitness may be high, further search is impeded as the effects of mutation and crossover ...
AAAI
2007
15 years 4 days ago
2007
Much of artificial intelligence research is focused on devising optimal solutions for challenging and well-defined but highly constrained problems. However, as we begin creating...
EVOW
2008
Springer
14 years 11 months ago
2008
Springer
We introduce the concept of "minimal" search algorithm for a set of functions to optimize. We investigate the structure of closed under permutation (c.u.p.) sets and we c...
100
click to vote
ACL
2006
14 years 11 months ago
2006
Lasso is a regularization method for parameter estimation in linear models. It optimizes the model parameters with respect to a loss function subject to model complexities. This p...