562 search results - page 35 / 113 » Simple Randomized Algorithms for Closest Pair Problems |
65
Voted
ICML
2003
IEEE
15 years 10 months ago
2003
IEEE
In this paper we present a simple to implement truly online large margin version of the Perceptron ranking (PRank) algorithm, called the OAP-BPM (Online Aggregate Prank-Bayes Poin...
ESA
2005
Springer
15 years 3 months ago
2005
Springer
We present a simple two-person Bucket Game, based on throwing balls into buckets, and we discuss possible players’ strategies. We use these strategies to create an approximation ...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
Recently, studies with the XCS classifier system on Boolean functions have shown that in certain types of functions simple crossover operators can lead to disruption and, conseque...
75
Voted
SIGMOD
2004
ACM
15 years 9 months ago
2004
ACM
Random sampling is one of the most fundamental data management tools available. However, most current research involving sampling considers the problem of how to use a sample, and...
63
Voted
CP
2004
Springer
15 years 3 months ago
2004
Springer
The stretch constraint occurs in many rostering problems that arise in the industrial and public service sectors. In this paper we present an efficient algorithm for domain consist...