4908 search results - page 348 / 982 » On the Complexity of Optimal K-Anonymity |
194
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
In recent decades, many meta-heuristics, including genetic algorithm (GA), ant colony optimization (ACO) and various local search (LS) procedures have been developed for solving a...
204
Voted
CORR
2007
Springer
15 years 6 months ago
2007
Springer
—A unified analytical framework for optimum power allocation in the unordered V-BLAST algorithm and its comparative performance analysis are presented. Compact closed-form appro...
168
click to vote
TALG
2008
15 years 6 months ago
2008
The Tower of Hanoi problem is generalized by placing pegs on the vertices of a given directed graph G with two distinguished vertices, S and D, and allowing moves only along arcs o...
174
click to vote
TWC
2008
15 years 6 months ago
2008
In this paper, a dynamic subcarrier and power allocation problem is considered in the context of asymptotic utility maximization in multi-carrier systems. Using the gradient-based...
163
click to vote
FGCS
2000
15 years 6 months ago
2000
This paper focuses on parallel query optimization. We consider the operator problem and introduce a new class of execution strategies called Linear-Oriented Bushy Trees (LBTs). Co...