12519 search results - page 119 / 2504 » Approximation Problems Categories |
179
click to vote
EVOW
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We present the newly developed core concept for the Multidimensional Knapsack Problem (MKP) which is an extension of the classical concept for the one-dimensional case. T...
196
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
We show that a k-fold covering using translates of an arbitrary convex polygon can be decomposed into Omega(k) covers (using an efficient algorithm). We generalize this result to ...
155
click to vote
JCO
2008
15 years 6 months ago
2008
In this paper we present two main results about the inapproximability of the exemplar conserved interval distance problem of genomes. First, we prove that it is NP-complete to deci...
155
click to vote
MOBIHOC
2008
ACM
16 years 6 months ago
2008
ACM
Local monitoring is an effective mechanism for the security of wireless sensor networks (WSNs). Existing schemes assume the existence of sufficient number of active nodes to carry...
153
click to vote
GECCO
2007
Springer
16 years 15 days ago
2007
Springer
ICSPEA is a novel multi-objective evolutionary algorithm which integrates aspects from the powerful variation operators of the Covariance Matrix Adaptation Evolution Strategy (CMA...