85 search results - page 12 / 17 » Hardness of Optimal Spaced Seed Design |
GECCO
2007
Springer
14 years 4 months ago
2007
Springer
The basic idea to defend in this paper is that an adequate perception of the search space, sacrificing most of the precision, can paradoxically accelerate the discovery of the mo...
EMSOFT
2010
Springer
13 years 7 months ago
2010
Springer
In the design of hard real-time systems, the feasibility of the task set is one of the primary concerns. However, in embedded systems with scarce resources, optimizing resource us...
GECCO
2007
Springer
14 years 4 months ago
2007
Springer
This paper describes the application of evolutionary search to the problem of Flash memory wear-out. The operating parameters of Flash memory are notoriously difficult to determin...
GECCO
2008
Springer
13 years 11 months ago
2008
Springer
Probabilistic model building methods can render difficult problems feasible by identifying and exploiting dependencies. They build a probabilistic model from the statistical prope...
KDD
2009
ACM
14 years 10 months ago
2009
ACM
Labeling text data is quite time-consuming but essential for automatic text classification. Especially, manually creating multiple labels for each document may become impractical ...