Sciweavers

14386 search results - page 237 / 2878
» The Chinese Generals Problem
Sort
View
PPSN
2004
Springer
15 years 10 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 10 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
TALG
2008
97views more  TALG 2008»
15 years 4 months ago
Average-case lower bounds for the plurality problem
Given a set of n elements, each of which is colored one of c 2 colors, we must determine an element of the plurality (most frequently occurring) color by pairwise equal/unequal co...
Laurent Alonso, Edward M. Reingold
149
Voted
IJCV
2000
133views more  IJCV 2000»
15 years 4 months ago
Heteroscedastic Regression in Computer Vision: Problems with Bilinear Constraint
We present an algorithm to estimate the parameters of a linear model in the presence of heteroscedastic noise, i.e., each data point having a different covariance matrix. The algor...
Yoram Leedan, Peter Meer