Sciweavers

16666 search results - page 2930 / 3334
» Descriptive and Computational Complexity
Sort
View
GECCO
2008
Springer
124views Optimization» more  GECCO 2008»
15 years 7 months ago
Runtime analysis of binary PSO
We investigate the runtime of the Binary Particle Swarm Optimization (PSO) algorithm introduced by Kennedy and Eberhart (1997). The Binary PSO maintains a global best solution and...
Dirk Sudholt, Carsten Witt
GECCO
2008
Springer
179views Optimization» more  GECCO 2008»
15 years 7 months ago
Evolution of discrete gene regulatory models
Gene regulatory networks (GRNs) are complex control systems that govern the interaction of genes, which ultimately control cellular processes at the protein level. GRNs can be ted...
Afshin Esmaeili, Christian Jacob
GECCO
2008
Springer
116views Optimization» more  GECCO 2008»
15 years 7 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 7 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 7 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 2930 / 3334 Last » Next »