322 search results - page 40 / 65 » On the Complexity of Reverse Similarity Search |
EVOW
2005
Springer
15 years 4 months ago
2005
Springer
In this work, we address the biclustering of gene expression data with evolutionary computation, which has been proven to have excellent performance on complex problems. In express...
CP
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. Invariants that incrementally maintain the value of expresder assignments to their variables are a natural abstraction to build high-level local search algorithms. But th...
ECAI
2008
Springer
15 years 1 months ago
2008
Springer
At the "functional level", Semantic Web Services (SWS) are described akin to planning operators, with preconditions and effects relative to an ontology; the ontology prov...
116
click to vote
SEBD
1997
15 years 21 days ago
1997
M-tree is a dynamic access method suitable to index generic “metric spaces”, where the function used to compute the distance between any two objects satisfies the positivity, ...
GECCO
2009
Springer
15 years 6 months ago
2009
Springer
In this paper, we consider multi-objective evolutionary algorithms for the Vertex Cover problem in the context of parameterized complexity. We relate the runtime of our algorithms...