Sciweavers

14774 search results - page 2557 / 2955
» Computational complexity and evolutionary computation
Sort
View
FSTTCS
2008
Springer
15 years 8 months ago
Graph Games on Ordinals
We consider an extension of Church’s synthesis problem to ordinals by adding limit transitions to graph games. We consider game arenas where these limit transitions are defined...
Julien Cristau, Florian Horn
GECCO
2008
Springer
174views Optimization» more  GECCO 2008»
15 years 8 months ago
Mask functions for the symbolic modeling of epistasis using genetic programming
The study of common, complex multifactorial diseases in genetic epidemiology is complicated by nonlinearity in the genotype-to-phenotype mapping relationship that is due, in part,...
Ryan J. Urbanowicz, Nate Barney, Bill C. White, Ja...
GECCO
2008
Springer
116views Optimization» more  GECCO 2008»
15 years 8 months ago
Multi-objective memetic approach for flexible process sequencing problems
This paper describes a multi-objective memetic approach for solving multi-objective flexible process sequencing problems in flexible manufacturing systems (FMSs). FMS can be des...
Jian-Hong Chen, Jian-Hung Chen
ICMCS
2010
IEEE
229views Multimedia» more  ICMCS 2010»
15 years 8 months ago
Decoder-side motion vector derivation for hybrid video inter coding
The ongoing increase of computing performance facilitates a higher algorithmical complexity in video coding systems. The decoder may be able to estimate or derive prediction param...
Steffen Kamp, Mathias Wien
ICML
2010
IEEE
15 years 8 months ago
Multi-Class Pegasos on a Budget
When equipped with kernel functions, online learning algorithms are susceptible to the "curse of kernelization" that causes unbounded growth in the model size. To addres...
Zhuang Wang, Koby Crammer, Slobodan Vucetic
« Prev « First page 2557 / 2955 Last » Next »