791 search results - page 76 / 159 » Nonstationary Function Optimization using the Structured Gen... |
144
click to vote
ISDA
2009
IEEE
15 years 11 months ago
2009
IEEE
Recent studies [13, 18] have shown that clearing schemes are efficient multi-modal optimization methods. They efficiently reduce genetic drift which is the direct reason for prema...
156
click to vote
CP
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. In this paper we propose an optimal anytime version of constrained simulated annealing (CSA) for solving constrained nonlinear programming problems (NLPs). One of the goa...
159
click to vote
BMCBI
2006
15 years 4 months ago
2006
Background: The problem of inferring the evolutionary history and constructing the phylogenetic tree with high performance has become one of the major problems in computational bi...
144
click to vote
UAI
2003
15 years 5 months ago
2003
Many practitioners who use EM and related algorithms complain that they are sometimes slow. When does this happen, and what can be done about it? In this paper, we study the gener...
145
click to vote
ECAI
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. We formulate the problem of least squares temporal difference learning (LSTD) in the framework of least squares SVM (LS-SVM). To cope with the large amount (and possible ...