1717 search results - page 169 / 344 » On the analysis of the (1 1) memetic algorithm |
219
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
208
click to vote
BMCBI
2005
15 years 6 months ago
2005
Motivation: In cluster analysis, the validity of specific solutions, algorithms, and procedures present significant challenges because there is no null hypothesis to test and no &...
158
click to vote
ICML
1995
IEEE
16 years 7 months ago
1995
IEEE
In the single rent-to-buy decision problem, without a priori knowledge of the amount of time a resource will be used we need to decide when to buy the resource, given that we can ...
173
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computation...
176
click to vote
ANCS
2005
ACM
16 years 16 hour ago
2005
ACM
We present Group Round-Robin (GRR) scheduling, a hybrid fair packet scheduling framework based on a grouping strategy that narrows down the traditional trade-off between fairness ...