4860 search results - page 220 / 972 » SNPs Problems, Complexity, and Algorithms |
98
Voted
GECCO
2008
Springer
15 years 1 months ago
2008
Springer
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
90
Voted
PODS
2006
ACM
16 years 22 days ago
2006
ACM
We initiate a novel study of clustering problems. Rather than specifying an explicit objective function to optimize, our framework allows the user of clustering algorithm to speci...
106
click to vote
COMPGEOM
2009
ACM
15 years 7 months ago
2009
ACM
Given a set system (X, R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H...
86
Voted
SPAA
2009
ACM
15 years 9 months ago
2009
ACM
Cache-oblivious algorithms have the advantage of achieving good sequential cache complexity across all levels of a multi-level cache hierarchy, regardless of the specifics (cache...
111
click to vote
JGAA
2006
15 years 17 days ago
2006
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...