4908 search results - page 131 / 982 » On the Complexity of Optimal K-Anonymity |
285
click to vote
ATAL
2005
Springer
15 years 12 months ago
2005
Springer
Negotiation techniques have been demonstrated to be effective in solving complex multi-objective problems. When the optimization process operates on continuous variables, it can b...
147
click to vote
EMO
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. In this paper, we propose an approach for solving hierarchical multi-objective optimization problems (MOPs). In realistic MOPs, two main challenges have to be considered:...
171
click to vote
PODS
2001
ACM
16 years 6 months ago
2001
ACM
The need to search for complex and recurring patterns in database sequences is shared by many applications. In this paper, we discuss how to express and support efficiently sophis...
183
click to vote
ICDE
2005
IEEE
16 years 1 days ago
2005
IEEE
Abstract— Distributed stream-based applications, such as continuous query systems, have network scale and time characteristics that challenge traditional distributed query optimi...
147
click to vote
ICDE
2010
IEEE
15 years 11 months ago
2010
IEEE
— Research on query optimization has traditionally focused on exhaustive enumeration of an exponential number of candidate plans. Alternatively, heuristics for query optimization...