7006 search results - page 464 / 1402 » Approximation Algorithms |
175
click to vote
EVOW
2006
Springer
15 years 9 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...
189
click to vote
APPROX
2004
Springer
15 years 11 months ago
2004
Springer
We consider a single-source network design problem from a game-theoretic perspective. Gupta, Kumar and Roughgarden (Proc. 35th Annual ACM STOC, pages 365–372, 2003) developed a ...
162
Voted
GECCO
2006
Springer
15 years 9 months ago
2006
Springer
This paper introduces XCSF extended with tile coding prediction: each classifier implements a tile coding approximator; the genetic algorithm is used to adapt both classifier cond...
168
click to vote
TCS
2008
15 years 6 months ago
2008
The medial axis is a classical representation of digital objects widely used in many applications. However, such a set of balls may not be optimal: subsets of the medial axis may ...
240
Voted
ICDE
2006
IEEE
16 years 7 months ago
2006
IEEE
K-Anonymity has been proposed as a mechanism for protecting privacy in microdata publishing, and numerous recoding "models" have been considered for achieving kanonymity...