129 search results - page 18 / 26 » A MAX-SAT Algorithm Portfolio |
CP
2011
Springer
12 years 7 months ago
2011
Springer
Algorithm portfolios aim to increase the robustness of our ability to solve problems efficiently. While recently proposed algorithm selection methods come ever closer to identifyin...
CP
2005
Springer
14 years 28 days ago
2005
Springer
Local search is a powerful and well-established method for solving hard combinatorial problems. Yet, until recently, it has provided very little user support, leading to time-consu...
JAIR
2008
13 years 7 months ago
2008
It has been widely observed that there is no single "dominant" SAT solver; instead, different solvers perform best on different instances. Rather than following the trad...
FCCM
2008
IEEE
14 years 1 months ago
2008
IEEE
The recent turmoil in global credit markets has demonstrated the need for advanced modelling of credit risk, which can take into account the effects of changing economic condition...
GECCO
2007
Springer
13 years 11 months ago
2007
Springer
Stock selection for hedge fund portfolios is a challenging problem for Genetic Programming (GP) because the markets (the environment in which the GP solution must survive) are dyn...