14774 search results - page 325 / 2955 » Computational complexity and evolutionary computation |
200
click to vote
SAC
2003
ACM
15 years 12 months ago
2003
ACM
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...
192
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: The identification of transcription factor binding sites is difficult since they are only a small number of nucleotides in size, resulting in large numbers of false po...
172
click to vote
TCSV
2010
15 years 1 months ago
2010
While peer-to-peer (P2P) video streaming systems have achieved promising results, they introduce a large number of unnecessary traverse links, which consequently leads to substanti...
203
click to vote
KDD
2012
ACM
13 years 9 months ago
2012
ACM
Traditional co-clustering methods identify block structures from static data matrices. However, the data matrices in many applications are dynamic; that is, they evolve smoothly o...
168
click to vote
SAC
2009
ACM
16 years 1 months ago
2009
ACM
This paper proposes a novel recombination scheme for evolutionary algorithms, which can guide the new population generation towards the maximum increase of the objective function....