Sciweavers

10901 search results - page 16 / 2181
» Approximations in Distributed Optimization
Sort
View
ICASSP
2011
IEEE
14 years 6 months ago
Empirical divergence maximization for quantizer design: An analysis of approximation error
Empirical divergence maximization is an estimation method similar to empirical risk minimization whereby the Kullback-Leibler divergence is maximized over a class of functions tha...
Michael A. Lexa
MOR
2007
149views more  MOR 2007»
15 years 1 months ago
LP Rounding Approximation Algorithms for Stochastic Network Design
Real-world networks often need to be designed under uncertainty, with only partial information and predictions of demand available at the outset of the design process. The field ...
Anupam Gupta, R. Ravi, Amitabh Sinha
TEC
2008
115views more  TEC 2008»
15 years 2 months ago
Function Approximation With XCS: Hyperellipsoidal Conditions, Recursive Least Squares, and Compaction
An important strength of learning classifier systems (LCSs) lies in the combination of genetic optimization techniques with gradient-based approximation techniques. The chosen app...
Martin V. Butz, Pier Luca Lanzi, Stewart W. Wilson
BMCBI
2005
115views more  BMCBI 2005»
15 years 2 months ago
Statistical distributions of optimal global alignment scores of random protein sequences
Background: The inference of homology from statistically significant sequence similarity is a central issue in sequence alignments. So far the statistical distribution function un...
Hongxia Pang, Jiaowei Tang, Su-Shing Chen, Shiheng...
GECCO
2004
Springer
128views Optimization» more  GECCO 2004»
15 years 7 months ago
Polynomial Approximation of Survival Probabilities Under Multi-point Crossover
Abstract. We propose an analytic approach to approximate the survival probabilities of schemata under multi-point crossover and obtain its closed form. It gives a convenient way to...
Sung-Soon Choi, Byung Ro Moon