2397 search results - page 67 / 480 » Applications of integer relation algorithms |
CPM
2000
Springer
15 years 2 months ago
2000
Springer
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
198
click to vote
COCOA
2011
Springer
13 years 9 months ago
2011
Springer
Biological networks are commonly used to model molecular activity within the cell. Recent experimental studies have shown that the detection of conserved subnetworks across several...
101
click to vote
CONTEXT
2003
Springer
15 years 3 months ago
2003
Springer
The development of more and more complex distributed applications over large networks of computers has raised the problem of semantic interoperability across applications based on ...
DAM
2010
14 years 9 months ago
2010
We introduce H -join decompositions of graphs, indexed by a fixed bipartite graph H . These decompositions are based on a graph operation that we call H -join, which adds edges be...
GECCO
1999
Springer
15 years 2 months ago
1999
Springer
In this paper we present a method based on preference relations for transforming non–crisp (qualitative) relationships between objectives in multi–objective optimisation into ...