Sciweavers

441 search results - page 33 / 89
» Convergence of Non-Elitist Strategies
Sort
View
WDAG
2009
Springer
146views Algorithms» more  WDAG 2009»
14 years 2 months ago
Dynamics in Network Interaction Games
We study the convergence times of dynamics in games involving graphical relationships of players. Our model of local interaction games generalizes a variety of recently studied ga...
Martin Hoefer, Siddharth Suri
ICC
2008
IEEE
199views Communications» more  ICC 2008»
14 years 2 months ago
Lower-Complexity Layered Belief-Propagation Decoding of LDPC Codes
Abstract— The design of LDPC decoders with low complexity, high throughput, and good performance is a critical task. A well-known strategy is to design structured codes such as q...
Yuan-Mao Chang, Andres I. Vila Casado, Mau-Chung F...
CEC
2007
IEEE
14 years 1 months ago
Clonal particle swarm optimization and its applications
— Particle swarm optimization (PSO) is a stochastic global optimization algorithm inspired by social behavior of bird flocking in search for food, which is a simple but powerful...
Y. Tan, Z. M. Xiao
CRV
2005
IEEE
201views Robotics» more  CRV 2005»
14 years 1 months ago
Minimum Bayes Error Features for Visual Recognition by Sequential Feature Selection and Extraction
The extraction of optimal features, in a classification sense, is still quite challenging in the context of large-scale classification problems (such as visual recognition), inv...
Gustavo Carneiro, Nuno Vasconcelos
ICGI
2004
Springer
14 years 28 days ago
Mutually Compatible and Incompatible Merges for the Search of the Smallest Consistent DFA
State Merging algorithms, such as Rodney Price’s EDSM (Evidence-Driven State Merging) algorithm, have been reasonably successful at solving DFA-learning problems. EDSM, however, ...
John Abela, François Coste, Sandro Spina