129 search results - page 12 / 26 » Tightness Time for the Linkage Learning Genetic Algorithm |
CEC
2010
IEEE
14 years 7 months ago
2010
IEEE
The great majority of genetic programming (GP) algorithms that deal with the classification problem follow a supervised approach, i.e., they consider that all fitness cases availab...
103
click to vote
GECCO
2007
Springer
15 years 1 months ago
2007
Springer
We have developed a technique to characterize software developers' styles using a set of source code metrics. This style fingerprint can be used to identify the likely author...
GECCO
2008
Springer
14 years 11 months ago
2008
Springer
This paper extends an adaptive discretization method, Spliton-Demand (SoD), to be capable of handling multidimensional continuous search spaces. The proposed extension is called m...
CGO
2005
IEEE
15 years 3 months ago
2005
IEEE
The growing complexity of modern processors has made the generation of highly efficient code increasingly difficult. Manual code generation is very time consuming, but it is oft...
127
click to vote
JMLR
2012
13 years 7 days ago
2012
We prove logarithmic regret bounds that depend on the loss L∗ T of the competitor rather than on the number T of time steps. In the general online convex optimization setting, o...