435 search results - page 71 / 87 » Partitioning Search Spaces of a Randomized Search |
GECCO
2003
Springer
15 years 3 months ago
2003
Springer
The performance of genetic programming relies mostly on population-contained variation. If the population diversity is low then there will be a greater chance of the algorithm bein...
100
click to vote
GECCO
2010
Springer
15 years 2 months ago
2010
Springer
One method of viral marketing involves seeding certain consumers within a population to encourage faster adoption of the product throughout the entire population. However, determi...
CSDA
2007
14 years 9 months ago
2007
The problem of choosing a good parameter setting for a better generalization performance in a learning task is the so-called model selection. A nested uniform design (UD) methodol...
BMCBI
2005
14 years 9 months ago
2005
Background: Searching for approximate patterns in large promoter sequences frequently produces an exceedingly high numbers of results. Our aim was to exploit biological knowledge ...
ATAL
2010
Springer
14 years 11 months ago
2010
Springer
A major research challenge in multi-agent systems is the problem of partitioning a set of agents into mutually disjoint coalitions, such that the overall performance of the system...