4908 search results - page 287 / 982 » On the Complexity of Optimal K-Anonymity |
180
click to vote
GECCO
2007
Springer
16 years 26 days ago
2007
Springer
In this work we present a novel and efficient algorithm– independent stopping criterion, called the MGBM criterion, suitable for Multiobjective Optimization Evolutionary Algorit...
178
Voted
INFOCOM
2002
IEEE
15 years 11 months ago
2002
IEEE
Abstract— In this paper, we address the problem of determining an optimal topology for Bluetooth Wireless Personal Area Networks (BT-WPANs). In BT-WPANs, multiple communication c...
206
click to vote
FOCS
1999
IEEE
15 years 11 months ago
1999
IEEE
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
196
click to vote
ISCI
2008
15 years 6 months ago
2008
Evolutionary algorithms (EAs) have been applied with success to many numerical and combinatorial optimization problems in recent years. However, they often lose their effectivenes...
196
click to vote
PVLDB
2010
15 years 5 months ago
2010
The need to improve a suboptimal execution plan picked by the query optimizer for a repeatedly run SQL query arises routinely. Complex expressions, skewed or correlated data, and ...