240 search results - page 8 / 48 » The Tree Inclusion Problem: In Optimal Space and Faster |
GECCO
2006
Springer
13 years 10 months ago
2006
Springer
Many metaheuristics have difficulty exploring their search space comprehensively. Exploration time and efficiency are highly dependent on the size and the ruggedness of the search...
ASPDAC
2001
ACM
13 years 10 months ago
2001
ACM
Clock-tuning has been classified as important but tough tasks due to the non-convex nature caused by the skew requirements. As a result, all existing mathematical programming appr...
SODA
2012
ACM
11 years 9 months ago
2012
ACM
We consider the dictionary problem in external memory and improve the update time of the wellknown buffer tree by roughly a logarithmic factor. For any λ ≥ max{lg lg n, logM/B(...
JDA
2007
13 years 7 months ago
2007
Ordering a set of items so as to minimize the sum of distances between consecutive elements is a fundamental optimization problem occurring in many settings. While it is NP-hard i...
WABI
2004
Springer
14 years 13 days ago
2004
Springer
—The problem of reconstructing the duplication history of a set of tandemly repeated sequences was first introduced by Fitch [4]. Many recent studies deal with this problem, show...