1795 search results - page 124 / 359 » Search by strategy |
146
click to vote
ECAI
2004
Springer
15 years 11 months ago
2004
Springer
Many decision problems can be modelled as adversarial constraint satisfaction, which allows us to integrate methods from AI game playing. In particular, by using the idea of oppone...
169
click to vote
EOR
2006
15 years 6 months ago
2006
This paper considers a project scheduling problem with the objective of minimizing resource availability costs, taking into account a deadline for the project and precedence relat...
191
click to vote
PSB
2003
15 years 7 months ago
2003
A number of biological applications require comparison of large genome strings. Current techniques suffer from both disk I/O and computational cost because of extensive memory req...
197
click to vote
FLAIRS
2007
15 years 8 months ago
2007
Using information from failures to guide subsequent search is an important technique for solving combinatorial problems in domains such as boolean satisfiability (SAT) and constr...
176
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
We benchmark the BI-population CMA-ES on the BBOB2009 noisy functions testbed. BI-population refers to a multistart strategy with equal budgets for two interlaced restart strategi...