4908 search results - page 65 / 982 » On the Complexity of Optimal K-Anonymity |
153
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
Hill-climbing has been shown to be more effective than exhaustive search in solving satisfiability problems.Also, it has been used either by itself or in combination with other ...
170
click to vote
JC
2008
15 years 6 months ago
2008
In this paper we analyze the problem of adaptivity for one-step numerical methods for solving ODEs, both IVPs and BVPs, with a view to generating grids of minimal computational co...
154
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
—This paper deals with optimized training sequences to estimate multiple-input multiple-output orthogonal frequencydivision multiplexing (MIMO-OFDM) channel states in the presenc...
147
click to vote
GECCO
2004
Springer
15 years 11 months ago
2004
Springer
We discuss the computational complexity of random 2D Ising spin glasses, which represent an interesting class of constraint satisfaction problems for black box optimization. Two ex...
268
click to vote
ICDE
2003
IEEE
16 years 7 months ago
2003
IEEE
Expressing complex OLAP queries using group-by, aggregation, and joins can be extremely difficult. As a result of this, many alternate ways of expressing such queries have been de...