Sciweavers

16093 search results - page 368 / 3219
» On the optimality of the neighbor-joining algorithm
Sort
View
EC
2008
153views ECommerce» more  EC 2008»
15 years 6 months ago
On Complexity of Optimal Recombination for Binary Representations of Solutions
We consider an optimization problem of finding the best possible offspring as a result of a recombination operator in an evolutionary algorithm, given two parent solutions. The op...
Anton V. Eremeev
ICMCS
2007
IEEE
194views Multimedia» more  ICMCS 2007»
16 years 1 months ago
Automatically Tuning Background Subtraction Parameters using Particle Swarm Optimization
A common trait of background subtraction algorithms is that they have learning rates, thresholds, and initial values that are hand-tuned for a scenario in order to produce the des...
Brandyn White, Mubarak Shah
CBSE
2005
Springer
16 years 12 days ago
Optimizing Resource Usage in Component-Based Real-Time Systems
This report presents data regarding simulation setup, the genetic algorithms setup and a short description to the use of the genetic algorithms. This report is written in the conte...
Johan Fredriksson, Kristian Sandström, Mikael...
SSS
2009
Springer
15 years 11 months ago
An Optimal Self-stabilizing Firing Squad
Consider a fully connected network where up to t processes may crash, and all processes start in an arbitrary memory state. The self-stabilizing firing squad problem consists of e...
Danny Dolev, Ezra N. Hoch, Yoram Moses
TEC
2008
135views more  TEC 2008»
15 years 6 months ago
Quantum Genetic Optimization
Abstract--The complexity of the selection procedure of a genetic algorithm that requires reordering, if we restrict the class of the possible fitness functions to varying fitness f...
Andrea Malossini, Enrico Blanzieri, T. Calarco