133 search results - page 9 / 27 » Approximation bounds for Black Hole Search problems |
NN
2002
Springer
14 years 11 months ago
2002
Springer
When learning a mixture model, we suffer from the local optima and model structure determination problems. In this paper, we present a method for simultaneously solving these prob...
113
click to vote
IANDC
2008
14 years 11 months ago
2008
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...
CDC
2009
IEEE
15 years 3 months ago
2009
IEEE
—In kernel based regression techniques (such as Support Vector Machines or Least Squares Support Vector Machines) it is hard to analyze the influence of perturbed inputs on the ...
141
Voted
WADS
2007
Springer
15 years 5 months ago
2007
Springer
Range searching is a well known problem in the area of geometric data structures. We consider this problem in the context of approximation, where an approximation parameter ε >...
98
Voted
GECCO
2008
Springer
15 years 22 days ago
2008
Springer
We investigate the effects of precision on the efficiency of various local search algorithms on 1-D unimodal functions. We present a (1 + 1)-EA with adaptive step size which fin...