4908 search results - page 641 / 982 » On the Complexity of Optimal K-Anonymity |
171
click to vote
GECCO
2004
Springer
16 years 6 days ago
2004
Springer
In a series of papers [3-8], Daida et. al. highlighted the difficulties posed to Genetic Programming (GP) by the complexity of the structural search space, and attributed the probl...
202
click to vote
GECCO
2004
Springer
16 years 6 days ago
2004
Springer
This article summarizes two experiments utilizing building blocks to find analog electronic circuits on a CMOS Field Programmable Transistor Array (FPTA). The FPTA features 256 pr...
201
click to vote
ICCS
2004
Springer
16 years 6 days ago
2004
Springer
In the present paper routing and wavelength assignment (RWA) in optical WDM networks is discussed. Previous techniques on based on the integer linear programming and graph coloring...
154
click to vote
IFIP
2004
Springer
16 years 6 days ago
2004
Springer
: Constructing a certification path is the mainly method of validating a certificate at given time. The established path will consist of all the valid certificates that reside betw...
139
click to vote
ILP
2004
Springer
16 years 6 days ago
2004
Springer
This paper focuses on inductive learning of recursive logical theories from a set of examples. This is a complex task where the learning of one predicate definition should be inter...