4908 search results - page 288 / 982 » On the Complexity of Optimal K-Anonymity |
192
click to vote
PLDI
2003
ACM
15 years 12 months ago
2003
ACM
Compiler writers have crafted many heuristics over the years to approximately solve NP-hard problems efficiently. Finding a heuristic that performs well on a broad range of applic...
201
click to vote
IEEEINTERACT
2002
IEEE
15 years 11 months ago
2002
IEEE
A dynamic optimizer is a software-based system that performs code modifications at runtime, and several such systems have been proposed over the past several years. These systems ...
190
click to vote
CEC
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract— Memetic algorithms arise as very effective algorithms to obtain reliable and high accurate solutions for complex continuous optimization problems. Nowadays, high dimens...
192
click to vote
EMO
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Most existing evolutionary approaches to multiobjective optimization aim at finding an appropriate set of compromise solutions, ideally a subset of the Pareto-optimal se...
177
click to vote
MMB
1999
Springer
15 years 11 months ago
1999
Springer
The rapidly increasing traffic demand from mobile users forces network operators and service providers to extend and optimize existing networks as well as to plan entirely new mo...