Sciweavers

12659 search results - page 241 / 2532
» The distributed breakout algorithms
Sort
View
GECCO
2007
Springer
183views Optimization» more  GECCO 2007»
16 years 25 days ago
Distribution replacement: how survival of the worst can out perform survival of the fittest
A new family of "Distribution Replacement” operators for use in steady state genetic algorithms is presented. Distribution replacement enforces the members of the populatio...
Howard Tripp, Phil Palmer
ATAL
2005
Springer
16 years 7 days ago
Preprocessing techniques for accelerating the DCOP algorithm ADOPT
Methods for solving Distributed Constraint Optimization Problems (DCOP) have emerged as key techniques for distributed reasoning. Yet, their application faces significant hurdles...
Syed Muhammad Ali, Sven Koenig, Milind Tambe
IPPS
1999
IEEE
15 years 11 months ago
Better Deterministic Routing on Meshes
Optimal randomized and deterministic algorithms have been given for k-k routing on two-dimensional nn meshes. The deterministic algorithm is based on "column-sort" and e...
Jop F. Sibeyn
ICIP
2005
IEEE
16 years 8 months ago
Approximations of posterior distributions in blind deconvolution using variational methods
In this paper the blind deconvolution problem is formulated using the variational framework. With its use approximations of the involved probability distributions are developed re...
Javier Mateos, Rafael Molina, Aggelos K. Katsaggel...
IJCAI
2007
15 years 8 months ago
An Improved Probabilistic Ant based Clustering for Distributed Databases
In this paper we present an improved version of the Probabilistic Ant based Clustering Algorithm for Distributed Databases (PACE). The most important feature of this algorithm is ...
Chandrasekar Ramachandran, Thanukrishnan Srinivasa...