829 search results - page 80 / 166 » Bandit Algorithms for Tree Search |
RECOMB
2000
Springer
15 years 1 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...
IJCAI
2003
14 years 11 months ago
2003
Given a set of numbers, and a set of bins of fixed capacity, the NP-complete problem of bin packing is to find the minimum number of bins needed to contain the numbers, such that ...
KDD
1995
ACM
15 years 1 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...
CPM
2005
Springer
15 years 3 months ago
2005
Springer
In this paper we propose new solution methods for designing tag sets for use in universal DNA arrays. First, we give integer linear programming formulations for two previous formal...
ICCS
2005
Springer
15 years 3 months ago
2005
Springer
In this paper we address two optimization problems arising in the design of genomic assays based on universal tag arrays. First, we address the universal array tag set design probl...