4908 search results - page 280 / 982 » On the Complexity of Optimal K-Anonymity |
157
Voted
DEBU
1999
15 years 6 months ago
1999
WOL is a Horn-clause language for specifying transformations involving complex types and recursive data-structures. Its declarative syntax makes programs easy to modify in respons...
158
click to vote
EUROCAST
2005
Springer
16 years 6 days ago
2005
Springer
abstract NP-hard optimization problem, in a general sense. From the observation that, intuitively, there are many connections among categorical concepts and structural complexity n...
140
click to vote
GECCO
2003
Springer
15 years 12 months ago
2003
Springer
It is clear from the study of complex non-linear systems in general, and evolutionary algorithms (EAs) in particular, that there is no single analysis tool or technique capable of ...
156
click to vote
ICCAD
1997
IEEE
15 years 11 months ago
1997
IEEE
This paper presents a new approach to hierarchical high-level synthesis with respect to internal register-transfer structures of complex components. Entire subdesigns can efficie...
216
click to vote
IJON
2008
15 years 5 months ago
2008
The problem of inductive supervised learning is discussed in this paper within the context of multi-objective (MOBJ) optimization. The smoothness-based apparent (effective) comple...