4908 search results - page 390 / 982 » On the Complexity of Optimal K-Anonymity |
231
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
Complete algorithms have been proposed to solve problems modelled as distributed constraint optimization (DCOP). However, there are only few attempts to address real world scenari...
169
click to vote
OWLED
2008
15 years 8 months ago
2008
Abstract. HermiT is a new OWL reasoner based on a novel "hypertableau" calculus. The new calculus addresses performance problems due to nondeterminism and model size--the...
183
click to vote
NIPS
2007
15 years 8 months ago
2007
Clustering is often formulated as a discrete optimization problem. The objective is to find, among all partitions of the data set, the best one according to some quality measure....
211
click to vote
AAAI
2006
15 years 8 months ago
2006
Among various feature extraction algorithms, those based on genetic algorithms are promising owing to their potential parallelizability and possible applications in large scale an...
183
click to vote
GECCO
2008
Springer
15 years 8 months ago
2008
Springer
Genetic algorithms (GAs) used in complex optimization domains usually need to perform a large number of fitness function evaluations in order to get near-optimal solutions. In rea...