4908 search results - page 339 / 982 » On the Complexity of Optimal K-Anonymity |
180
Voted
GECCO
2005
Springer
16 years 9 days ago
2005
Springer
We propose a new evolutionary approach to solve the 0/1 multiple knapsack problem. We approach the problem from a new viewpoint different from traditional methods. The most remar...
194
click to vote
ECCV
2010
Springer
16 years 3 days ago
2010
Springer
3D human pose estimation in multi-view settings benefits from embeddings of human actions in low-dimensional manifolds, but the complexity of the embeddings increases with the num...
179
click to vote
GLOBECOM
2009
IEEE
15 years 10 months ago
2009
IEEE
The unit-norm constraint optimization for joint shortening of channel and echo impulse response is presented in this paper. The optimization is performed in the mean-square sense (...
193
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
Metaheuristics have often been shown to be effective for difficult combinatorial optimization problems. The reason for that, however, remains unclear. A framework for a theory of ...
186
click to vote
GECCO
2009
Springer
15 years 10 months ago
2009
Springer
Evolutionary functional testing is an approach to automatically generating test cases that violate a certain functional system requirement. This paper proposes an approach suitabl...