1158 search results - page 166 / 232 » Approximation Algorithms for the Fixed-Topology Phylogenetic... |
156
click to vote
ENC
2005
IEEE
15 years 11 months ago
2005
IEEE
Generally, evolutionary algorithms require a large number of evaluations of the objective function in order to obtain a good solution. This paper presents a simple approach to sav...
169
Voted
STOC
2003
ACM
15 years 11 months ago
2003
ACM
Given a k-uniform hypergraph, the Ek-Vertex-Cover problem is to find the smallest subset of vertices that intersects every hyperedge. We present a new multilayered PCP constructi...
166
click to vote
IPPS
2008
IEEE
16 years 15 days ago
2008
IEEE
Many efforts have been made for addressing coverage problems in sensor networks. They fall into two categories, full coverage and barrier coverage, featured as static coverage. In...
199
click to vote
SPIRE
2010
Springer
15 years 4 months ago
2010
Springer
The Longest Common Subsequence (LCS) of two or more strings is a fundamental well-studied problem which has a wide range of applications throughout computational sciences. When the...
162
click to vote
WIDM
2006
ACM
16 years 1 days ago
2006
ACM
For a given set of search engines, a search engine is redundant if its searchable contents can be found from other search engines in this set. In this paper, we propose a method t...