Sciweavers

16088 search results - page 337 / 3218
» A Mean-Variance Optimization algorithm
Sort
View
ECAI
2008
Springer
15 years 9 months ago
Dynamic Backtracking for Distributed Constraint Optimization
We propose a new algorithm for solving Distributed Constraint Optimization Problems (DCOPs). Our algorithm, called DyBop, is based on branch and bound search with dynamic ordering ...
Redouane Ezzahir, Christian Bessiere, Imade Benela...
ICMLA
2004
15 years 8 months ago
A new discrete binary particle swarm optimization based on learning automata
: The particle swarm is one of the most powerful methods for solving global optimization problems. This method is an adaptive algorithm based on social-psychological metaphor. A po...
Reza Rastegar, Mohammad Reza Meybodi, Kambiz Badie
JPDC
2000
47views more  JPDC 2000»
15 years 7 months ago
Time-Step Optimal Broadcasting in 3-D Meshes with Minimum Total Communication Distance
In this paper we propose a new minimum total communication distance T CD algorithm and an optimal T CD algorithm for broadcast in a 3-dimensional mesh 3-D mesh. The former generat...
Songluan Cang, Jie Wu
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