Sciweavers

14165 search results - page 201 / 2833
» The generalized two-server problem
Sort
View
CORR
2007
Springer
120views Education» more  CORR 2007»
15 years 4 months ago
Random subcubes as a toy model for constraint satisfaction problems
We present an exactly solvable random-subcube model inspired by the structure of hard constraint satisfaction and optimization problems. Our model reproduces the structure of the s...
Thierry Mora, Lenka Zdeborová
ECAI
2004
Springer
15 years 9 months ago
Improving Asynchronous Backtracking for Dealing with Complex Local Problems
Distributed constraint satisfaction, in its most general acceptation, involves a collection of agents solving local constraint satisfaction subproblems, and a communication protoco...
Arnold Maestre, Christian Bessière
PPSN
2004
Springer
15 years 9 months ago
Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization
It is typical for the EA community that theory follows experiments. Most theoretical approaches use some model of the considered evolutionary algorithm (EA) but there is also some ...
Patrick Briest, Dimo Brockhoff, Bastian Degener, M...
PPSN
2004
Springer
15 years 9 months ago
A Simple Two-Module Problem to Exemplify Building-Block Assembly Under Crossover
Theoretically and empirically it is clear that a genetic algorithm with crossover will outperform a genetic algorithm without crossover in some fitness landscapes, and vice versa i...
Richard A. Watson
SIAMSC
2008
145views more  SIAMSC 2008»
15 years 4 months ago
Fast Multilevel Algorithm for a Minimization Problem in Impulse Noise Removal
An effective 2-phase method for removing impulse noise was recently proposed. Its phase 1 identifies noisy pixel candidates by using median-type filters. Then in phase 2, it resto...
Raymond H. Chan, Ke Chen 0002