12519 search results - page 180 / 2504 » Approximation Problems Categories |
139
click to vote
MOR
2002
15 years 6 months ago
2002
Semidefinite feasibility problems arise in many areas of operations research. The abstract form of these problems can be described as finding a point in a nonempty bounded convex b...
196
click to vote
PKC
2010
Springer
15 years 4 months ago
2010
Springer
The Pollard kangaroo method solves the discrete logarithm problem (DLP) in an interval of size N with heuristic average case expected running time approximately 2 √ N group opera...
184
click to vote
SIAMJO
2010
15 years 1 months ago
2010
We study the problem of minimizing the expected loss of a linear predictor while constraining its sparsity, i.e., bounding the number of features used by the predictor. While the r...
177
click to vote
GECCO
2007
Springer
16 years 18 days ago
2007
Springer
Transgenetic algorithms are evolutionary computing techniques based on living processes where cooperation is the main evolutionary strategy. Those processes contain the movement o...
172
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
Shin et al [19] and McKay et al [15] previously applied tree compression and semantics-based simplification to study the distribution of building blocks in evolving Genetic Progr...