4908 search results - page 283 / 982 » On the Complexity of Optimal K-Anonymity |
156
click to vote
VLDB
1991
ACM
15 years 10 months ago
1991
ACM
The development of a distributed database systemrequires effective solutions to many complex and interrelated design problems. The cost dependenciesbetween query optimization and ...
208
click to vote
EUROGP
2007
Springer
15 years 8 months ago
2007
Springer
Geometric particle swarm optimization (GPSO) is a recently introduced formal generalization of traditional particle swarm optimization (PSO) that applies naturally to both continu...
188
click to vote
AGI
2008
15 years 8 months ago
2008
Universal induction solves in principle the problem of choosing a prior to achieve optimal inductive inference. The AIXI theory, which combines control theory and universal induct...
155
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Parallel Global Optimization Algorithms (PGOA) provide an efficient way of dealing with hard optimization problems. One method of parallelization of GOAs that is frequently applie...
140
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Abstract— We consider power allocation algorithms for fixedrate transmission over Nakagami-m non-ergodic block-fading channels with perfect transmitter and receiver channel stat...