434 search results - page 39 / 87 » Constraint-Based Combinators for Local Search |
277
click to vote
SIGMOD
2009
ACM
16 years 5 months ago
2009
ACM
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
136
click to vote
ICDM
2003
IEEE
15 years 10 months ago
2003
IEEE
A novel approach to clustering co-occurrence data poses it as an optimization problem in information theory which minimizes the resulting loss in mutual information. A divisive cl...
148
click to vote
CEC
2008
IEEE
15 years 11 months ago
2008
IEEE
: Differential evolutionary (DE) mutates solution vectors by the weighted difference of other vectors using arithmetic operations. As these operations cannot be directly extended t...
142
click to vote
CEC
2008
IEEE
15 years 11 months ago
2008
IEEE
Abstract— The DNA fragment assembly problem is to reconstruct a DNA chain from multiple fragments that have previously been sequenced in a laboratory. This is a critical step in ...
156
click to vote
ECMDAFA
2010
Springer
15 years 8 months ago
2010
Springer
Dynamic UML models like sequence diagrams (SD) lack sufficient formal semantics, making it difficult to build automated tools for their analysis, simulation and validation. A commo...