4908 search results - page 355 / 982 » On the Complexity of Optimal K-Anonymity |
165
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
We present two novel perturbation-based linkage learning algorithms that extend LINC [5]; a version of LINC optimised for decomposition tasks (oLINC) and a hierarchical version of...
182
click to vote
CLUSTER
2001
IEEE
15 years 10 months ago
2001
IEEE
In this paper, we revisit the master-slave tasking paradigm in the context of heterogeneous processors. We assume that communications take place in exclusive mode. We present a po...
181
click to vote
ICLP
1995
Springer
15 years 10 months ago
1995
Springer
We present the wamcc system, a Prolog compiler that translates Prolog to C via the WAM. This approach has some interesting consequences: simplicity, efficiency, portability, exten...
193
click to vote
EMO
2006
Springer
15 years 8 months ago
2006
Springer
Multi-objective metaheuristics have previously been applied to partial classification, where the objective is to produce simple, easy to understand rules that describe subsets of a...
143
click to vote
WSC
2004
15 years 8 months ago
2004
Simulation methods are extensively used in modeling complex scheduling problems. However, traditional layout of simulation models can become complicated when they are used to find...