6562 search results - page 124 / 1313 » Noetherianity and Combination Problems |
144
Voted
CEC
2008
IEEE
15 years 11 months ago
2008
IEEE
— Recently it has been proved that the (1+1)-EA produces poor worst-case approximations for the vertex cover problem. In this paper the result is extended to the (1+λ)-EA by pro...
129
click to vote
CPAIOR
2007
Springer
15 years 10 months ago
2007
Springer
Portfolio selection is a relevant problem arising in finance and economics. While its basic formulations can be efficiently solved through linear or quadratic programming, its mor...
108
Voted
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
In this paper, we describe a new algorithm that consists in combining an eye-tracker for minimizing the fatigue of a user during the evaluation process of Interactive Evolutionary...
131
click to vote
LPAR
2001
Springer
15 years 9 months ago
2001
Springer
When writing a constraint program, we have to decide what to make the decision variable, and how to represent the constraints on these variables. In many cases, there is considerab...
202
click to vote
ISTCS
1997
Springer
15 years 8 months ago
1997
Springer
We investigate the power of quantum computers when they are required to return an answer that is guaranteed to be correct after a time that is upper-bounded by a polynomial in the...