3055 search results - page 428 / 611 » Randomized Search Trees |
144
click to vote
CIAC
2006
Springer
15 years 8 months ago
2006
Springer
Complementing recent progress on classical complexity and polynomial-time approximability of feedback set problems in (bipartite) tournaments, we extend and partially improve fixed...
160
click to vote
RECOMB
2000
Springer
15 years 8 months ago
2000
Springer
We present a lossless compression algorithm, GenCompress, for genetic sequences, based on searching for approximate repeats. Our algorithm achieves the best compression ratios for...
127
click to vote
KDD
1995
ACM
15 years 8 months ago
1995
ACM
This paper introduces a newalgorithm called SIAO1 for learning first order logic rules withgenetic algorithms. SIAO1uses the covering principle developed in AQwhereseed examplesar...
144
click to vote
ICDE
1991
IEEE
15 years 7 months ago
1991
IEEE
Existing Database Management Systems (DBMSs) do not handle efficiently multi-dimensional data such as boxes, polygons, or even points in a multi-dimensional space. We examine acc...
112
click to vote
DIS
2007
Springer
15 years 6 months ago
2007
Springer
In this paper, we propose a new concept, thinning-out, for reducing the number of trials in skill discovery. Thinning-out means to skip over such trials that are unlikely to improv...