4908 search results - page 171 / 982 » On the Complexity of Optimal K-Anonymity |
201
click to vote
GECCO
2005
Springer
16 years 20 hour ago
2005
Springer
Many real-world problems are multi-objective optimization problems and evolutionary algorithms are quite successful on such problems. Since the task is to compute or approximate t...
190
click to vote
ARCS
2004
Springer
15 years 12 months ago
2004
Springer
: This paper addresses the optimization of a dynamic Traveling Salesman Problem using the Ant Colony Optimization algorithm. Ants are social insects with limited skills that live i...
169
click to vote
ICCAD
1999
IEEE
15 years 10 months ago
1999
IEEE
This paper addresses an optimal technique for throughput optimization of general non-linear data flow computations using a set of transformations. Throughput is widely recognized ...
148
click to vote
DBPL
1991
Springer
15 years 10 months ago
1991
Springer
We present a functional DBPL in the style of FP that facilitates the definition of precise semantics and opens up opportunities for far-reaching optimizations. The language is int...
184
click to vote
VLDB
1991
ACM
15 years 10 months ago
1991
ACM
In order to cope efficiently with simple or complex queries as well as different application requirements (e.g., ad-hoc versus repetitive queries), a query optimizer ought to supp...