377 search results - page 14 / 76 » A Fast Heuristic Algorithm for a Probe Mapping Problem |
DAC
1999
ACM
14 years 9 months ago
1999
ACM
Finding the minimum column multiplicity for a bound set of variables is an important problem in Curtis decomposition. To investigate this problem, we compared two graphcoloring pr...
FPL
1997
Springer
14 years 27 days ago
1997
Springer
Technology mapping can be viewed as the optimization problem of finding a minimum cost cover of the given Boolean network by choosing from given library of logic cells. The core of...
BMCBI
2010
13 years 8 months ago
2010
Background: There are many important clustering questions in computational biology for which no satisfactory method exists. Automated clustering algorithms, when applied to large,...
KDD
2002
ACM
14 years 9 months ago
2002
ACM
This paper studies the problem of categorical data clustering, especially for transactional data characterized by high dimensionality and large volume. Starting from a heuristic m...
AIPS
2000
13 years 10 months ago
2000
hsp and hspr are two recent planners that search the state-space using an heuristic function extracted from Strips encodings. hsp does a forward search from the initial state reco...