444 search results - page 75 / 89 » Solving Mastermind Using Genetic Algorithms |
GECCO
2005
Springer
15 years 6 months ago
2005
Springer
Evaluating GP schema in context is considered to be a complex, and, at times impossible, task. The tightly linked nodes of a GP tree is the main reason behind its complexity. This...
144
Voted
ICCSA
2007
Springer
15 years 2 months ago
2007
Springer
A style dress outlet usually purchases products from multiple suppliers with different cost, quality and selling price. It is assumed that some suppliers will sell their goods to t...
111
click to vote
ENDM
2006
15 years 14 days ago
2006
We consider a dynamic planning problem for paratransit transportation. The focus is on a decision to take one day ahead: which requests to serve with own vehicles, and which reque...
90
Voted
IJON
2007
15 years 11 days ago
2007
In this paper, a ridgelet kernel regression model is proposed for approximation of high dimensional functions. It is based on ridgelet theory, kernel and regularization technology ...
TCBB
2008
15 years 11 days ago
2008
Abstract-- The Maximum Parsimony problem aims at reconstructing a phylogenetic tree from DNA sequences while minimizing the number of genetic transformations. To solve this NP-comp...