4908 search results - page 214 / 982 » On the Complexity of Optimal K-Anonymity |
180
click to vote
HIPEAC
2005
Springer
16 years 3 days ago
2005
Springer
This article aims at making iterative optimization practical and usable by speeding up the evaluation of a large range of optimizations. Instead of using a full run to evaluate a s...
172
click to vote
ICC
2009
IEEE
16 years 1 months ago
2009
IEEE
—In this paper we propose a new low feedback and low complexity scheme that adjusts the phases at the relays, thus allowing for the coherent combining of signals from multiple re...
173
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
In this paper, we study instances of complex neural networks, i.e. neural networks with complex topologies. We use Self-Organizing Map neural networks whose neighborhood relations...
144
click to vote
GECCO
2005
Springer
16 years 3 days ago
2005
Springer
The interaction among variables of an optimization problem is known as epistasis, and its degree is an important measure for the nonlinearity of the problem. We address the proble...
194
click to vote
TPDS
2008
15 years 6 months ago
2008
When employing a consensus algorithm for state machine replication, should one optimize for the case that all communication links are usually timely, or for fewer timely links? Do...