1732 search results - page 134 / 347 » Sequences of Level 1, 2, 3, ..., k , .. |
156
click to vote
FAW
2007
Springer
16 years 20 days ago
2007
Springer
In this paper, we consider a map labeling problem to maximize the number of independent labels in the plane. We first investigate the point labeling model that each label can be ...
186
click to vote
SSD
2001
Springer
15 years 11 months ago
2001
Springer
Spatial joins are fundamental in spatial databases. Over the last decade, the primary focus of research has been on joins with the predicate “region intersection.” In modern da...
187
click to vote
GECCO
2004
Springer
15 years 12 months ago
2004
Springer
Hybrid algorithms that combine genetic algorithms with the Nelder-Mead simplex algorithm have been effective in solving certain optimization problems. In this article, we apply a s...
172
click to vote
COMPGEOM
2007
ACM
15 years 10 months ago
2007
ACM
We study the following variant of the well-known line-simplification problem: we are getting a possibly infinite sequence of points p0, p1, p2, . . . in the plane defining a polyg...
157
click to vote
GECCO
2010
Springer
15 years 10 months ago
2010
Springer
This paper presents the result for Simultaneous Perturbation Stochastic Approximation (SPSA) on the BBOB 2010 noisy testbed. SPSA is a stochastic gradient approximation strategy w...