1977 search results - page 258 / 396 » The satisfactory partition problem |
175
click to vote
CPM
1999
Springer
15 years 10 months ago
1999
Springer
We present a new indexing method for the approximate string matching problem. The method is based on a su x tree combined with a partitioning of the pattern. We analyze the resulti...
153
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
This paper presents our work on the static task scheduling model using the mean-field annealing (MFA) technique. Mean-field annealing is a technique of thermostatic annealing that...
148
click to vote
SWAT
1992
Springer
15 years 10 months ago
1992
Springer
Abstract. In a decision tree model, (n log2 n m i=1 ni log2 ni + n) is known to be a lower bound for sorting a multiset of size n containing m distinct elements, where the ith dist...
175
click to vote
ASPDAC
2007
ACM
15 years 10 months ago
2007
ACM
- This paper proposes a fast and practical decoupling capacitor (decap) budgeting algorithm to optimize the power ground (P/G) network design. The new method adopts a modified rand...
148
click to vote
ICARIS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. String-based negative selection is an immune-inspired classification scheme: Given a self-set S of strings, generate a set D of detectors that do not match any element of...