4908 search results - page 80 / 982 » On the Complexity of Optimal K-Anonymity |
166
click to vote
DAGSTUHL
2004
15 years 7 months ago
2004
We consider the global optimization problem for d-variate Lipschitz functions which, in a certain sense, do not increase too slowly in a neighborhood of the global minimizer(s). O...
168
click to vote
CEC
2008
IEEE
16 years 20 days ago
2008
IEEE
—As more and more real-world optimization problems become increasingly complex, algorithms with more capable optimizations are also increasing in demand. For solving large scale ...
209
click to vote
SOCO
2012
Springer
14 years 1 months ago
2012
Springer
Abstract Population-based meta-heuristics are algorithms that can obtain very good results for complex continuous optimization problems in a reduced amount of time. These search al...
170
click to vote
WDAG
2004
Springer
15 years 11 months ago
2004
Springer
An important problem in distributed systems is to detect termination of a distributed computation. A computation is said to have terminated when all processes have become passive ...
195
click to vote
CCECE
2006
IEEE
16 years 8 days ago
2006
IEEE
Multiuser detection (MUD) techniques are known to improve the performance of CDMA cellular communication systems. This performance improvement usually comes at a large computation...