4908 search results - page 71 / 982 » On the Complexity of Optimal K-Anonymity |
153
click to vote
GLOBECOM
2007
IEEE
16 years 15 days ago
2007
IEEE
The Laurent Decomposition expresses any binary single-h CPM waveform as the summation of a finite number of pulse amplitude modulated components, and this result has been useful i...
182
click to vote
HPCC
2007
Springer
16 years 10 days ago
2007
Springer
Many optimization techniques have been adopted for efficient job scheduling in grid computing, such as: genetic algorithms, simulated annealing and stochastic methods. Such techni...
164
click to vote
GECCO
2000
Springer
15 years 9 months ago
2000
Springer
This paper gives a theoretical and empirical analysis of the time complexity of genetic algorithms (GAs) on problems with exponentially scaled building blocks. It is important to ...
184
click to vote
TSP
2008
15 years 6 months ago
2008
The two-band discrete wavelet transform (DWT) provides an octave-band analysis in the frequency domain, but this might not be "optimal" for a given signal. The discrete w...
146
click to vote
CCE
2004
15 years 6 months ago
2004
This paper describes an optimization procedure for the synthesis of complex distillation configurations. A superstructure based on the Reversible Distillation Sequence Model (RDSM...