Sciweavers

2996 search results - page 331 / 600
» Numberings and Randomness
Sort
View
GPEM
2000
103views more  GPEM 2000»
15 years 6 months ago
Size Fair and Homologous Tree Crossovers for Tree Genetic Programming
Abstract. Size fair and homologous crossover genetic operators for tree based genetic programming are described and tested. Both produce considerably reduced increases in program s...
William B. Langdon
PAMI
1998
86views more  PAMI 1998»
15 years 6 months ago
Spatial Sampling of Printed Patterns
—The bitmap obtained by scanning a printed pattern depends on the exact location of the scanning grid relative to the pattern. We consider ideal sampling with a regular lattice o...
Prateek Sarkar, George Nagy, Jiangying Zhou, Danie...
SIAMJO
2002
124views more  SIAMJO 2002»
15 years 6 months ago
The Sample Average Approximation Method for Stochastic Discrete Optimization
In this paper we study a Monte Carlo simulation based approach to stochastic discrete optimization problems. The basic idea of such methods is that a random sample is generated and...
Anton J. Kleywegt, Alexander Shapiro, Tito Homem-d...
TIT
2002
102views more  TIT 2002»
15 years 6 months ago
Asymptotic efficiency of two-stage disjunctive testing
Abstract--We adapt methods originally developed in information and coding theory to solve some testing problems. The efficiency of two-stage pool testing of items is characterized ...
Toby Berger, Vladimir I. Levenshtein
MP
2007
95views more  MP 2007»
15 years 6 months ago
Smoothed analysis of integer programming
We present a probabilistic analysis of integer linear programs (ILPs). More specifically, we study ILPs in a so-called smoothed analysis in which it is assumed that first an adve...
Heiko Röglin, Berthold Vöcking