Sciweavers

874 search results - page 74 / 175
» Faster Algorithms for Semi-Matching Problems
Sort
View
UAI
2003
13 years 9 months ago
Approximate Inference and Constrained Optimization
Loopy and generalized belief propagation are popular algorithms for approximate inference in Markov random fields and Bayesian networks. Fixed points of these algorithms correspo...
Tom Heskes, Kees Albers, Bert Kappen
GECCO
2008
Springer
144views Optimization» more  GECCO 2008»
13 years 8 months ago
Maintaining diversity through adaptive selection, crossover and mutation
This paper presents an Adaptive Genetic Algorithm (AGA) where selection pressure, crossover and mutation probabilities are adapted according to population diversity statistics. Th...
Brian McGinley, Fearghal Morgan, Colm O'Riordan
APIN
2002
90views more  APIN 2002»
13 years 7 months ago
Scalable Techniques from Nonparametric Statistics for Real Time Robot Learning
Abstract: Locally weighted learning (LWL) is a class of techniques from nonparametric statistics that provides useful representations and training algorithms for learning about com...
Stefan Schaal, Christopher G. Atkeson, Sethu Vijay...
CIKM
2011
Springer
12 years 7 months ago
Scalable entity matching computation with materialization
Entity matching (EM) is the task of identifying records that refer to the same real-world entity from different data sources. While EM is widely used in data integration and data...
Sanghoon Lee, Jongwuk Lee, Seung-won Hwang
COCO
2011
Springer
221views Algorithms» more  COCO 2011»
12 years 7 months ago
Non-uniform ACC Circuit Lower Bounds
The class ACC consists of circuit families with constant depth over unbounded fan-in AND, OR, NOT, and MODm gates, where m > 1 is an arbitrary constant. We prove: • NTIME[2n ...
Ryan Williams