Sciweavers

3270 search results - page 160 / 654
» Approximate String Processing
Sort
View
CSDA
2008
67views more  CSDA 2008»
15 years 2 months ago
How useful are approximations to mean and variance of the index of dissimilarity?
Sociologists, demographers, and economists often use the index of dissimilarity, D, to describe the extent of racial, ethnic, spatial, or areal dissimilarity (or segregation) of d...
Madhuri S. Mulekar, John C. Knutson, Jyoti A. Cham...
ATAL
2010
Springer
14 years 9 months ago
Approximate dynamic programming with affine ADDs
The Affine ADD (AADD) is an extension of the Algebraic Decision Diagram (ADD) that compactly represents context-specific, additive and multiplicative structure in functions from a...
Scott Sanner, William T. B. Uther, Karina Valdivia...
106
Voted
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
15 years 8 months ago
Convergence of stochastic search algorithms to gap-free pareto front approximations
Recently, a convergence proof of stochastic search algorithms toward finite size Pareto set approximations of continuous multi-objective optimization problems has been given. The...
Oliver Schütze, Marco Laumanns, Emilia Tantar...
110
Voted
CIKM
2003
Springer
15 years 7 months ago
Dimensionality reduction using magnitude and shape approximations
High dimensional data sets are encountered in many modern database applications. The usual approach is to construct a summary of the data set through a lossy compression technique...
Ümit Y. Ogras, Hakan Ferhatosmanoglu
114
Voted
GECCO
2006
Springer
177views Optimization» more  GECCO 2006»
15 years 6 months ago
Hyper-ellipsoidal conditions in XCS: rotation, linear approximation, and solution structure
The learning classifier system XCS is an iterative rulelearning system that evolves rule structures based on gradient-based prediction and rule quality estimates. Besides classifi...
Martin V. Butz, Pier Luca Lanzi, Stewart W. Wilson