7006 search results - page 217 / 1402 » Approximation Algorithms |
116
click to vote
STOC
1996
ACM
15 years 7 months ago
1996
ACM
The frequency moments of a sequence containing mi elements of type i, for 1 i n, are the numbers Fk = n i=1 mk i . We consider the space complexity of randomized algorithms that...
118
click to vote
CEC
2003
IEEE
15 years 8 months ago
2003
IEEE
Neural networks and the Kriging method are compared for constructing £tness approximation models in evolutionary optimization algorithms. The two models are applied in an identica...
119
Voted
SIGECOM
2010
ACM
15 years 8 months ago
2010
ACM
In 1876 Charles Lutwidge Dodgson suggested the intriguing voting rule that today bears his name. Although Dodgson’s rule is one of the most well-studied voting rules, it suffers...
129
Voted
ICML
2009
IEEE
15 years 10 months ago
2009
IEEE
We propose a deterministic method to evaluate the integral of a positive function based on soft-binning functions that smoothly cut the integral into smaller integrals that are ea...
228
Voted
APPROX
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. In this paper we introduce a new technique for approximation schemes for geometrical optimization problems. As an example problem, we consider the following variant of th...