435 search results - page 76 / 87 » Partitioning Search Spaces of a Randomized Search |
ICCBR
2005
Springer
15 years 5 months ago
2005
Springer
While several researchers have applied case-based reasoning techniques to games, only Ponsen and Spronck (2004) have addressed the challenging problem of learning to win real-time ...
129
click to vote
SIGIR
2004
ACM
15 years 5 months ago
2004
ACM
We present a probabilistic model for a document corpus that combines many of the desirable features of previous models. The model is called “GaP” for Gamma-Poisson, the distri...
81
Voted
GECCO
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Bloat is a common and well studied problem in genetic programming. Size and depth limits are often used to combat bloat, but to date there has been little detailed explor...
CP
2003
Springer
15 years 4 months ago
2003
Springer
This work introduces a combinatorial optimization problem called Mars Express Memory Dumping Problem (Mex-Mdp), which arises in the European Space Agency program Mars Express. It c...
101
click to vote
FPL
2003
Springer
15 years 4 months ago
2003
Springer
Local search methods such as WSAT have proven to be successful for solving SAT problems. In this paper, we propose two host-FPGA (Field Programmable Gate Array) co-implementations,...