4908 search results - page 742 / 982 » On the Complexity of Optimal K-Anonymity |
154
click to vote
ICNC
2009
Springer
16 years 1 months ago
2009
Springer
The main purpose of this paper is to propose an incorporating a grammatical evolution (GE) into the genetic algorithm (GA), called GEGA, and apply it to estimate the compressive s...
172
click to vote
ICNC
2009
Springer
16 years 1 months ago
2009
Springer
A model-free, biologically-motivated learning and control algorithm called S-learning is described as implemented in an Surveyor SRV-1 mobile robot. S-learning demonstrated learni...
196
click to vote
KI
2009
Springer
16 years 1 months ago
2009
Springer
Today’s complex production systems allow to simultaneously build different products following individual production plans. Such plans may fail due to component faults or unfores...
148
click to vote
KI
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Many heuristic estimators for classical planning are based on the socalled delete relaxation, which ignores negative effects of planning operators. Ideally, such heuristi...
182
click to vote
PKDD
2009
Springer
16 years 1 months ago
2009
Springer
Most existing semi-supervised learning methods are based on the smoothness assumption that data points in the same high density region should have the same label. This assumption, ...