4908 search results - page 381 / 982 » On the Complexity of Optimal K-Anonymity |
192
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
190
click to vote
GLOBECOM
2006
IEEE
16 years 27 days ago
2006
IEEE
Abstract—Employing multiple base stations is an attractive approach to enhance the lifetime of wireless sensor networks. In this paper, we address the fundamental question concer...
132
click to vote
CEC
2005
IEEE
16 years 14 days ago
2005
IEEE
—A principal challenge in modern computational finance is efficient portfolio design – portfolio optimization followed by decision-making. Optimization based on even the widely...
200
click to vote
CRV
2005
IEEE
16 years 14 days ago
2005
IEEE
The extraction of optimal features, in a classification sense, is still quite challenging in the context of large-scale classification problems (such as visual recognition), inv...
145
click to vote
EMO
2005
Springer
16 years 11 days ago
2005
Springer
Abstract. The optimization and design of two different types of photonic devices - a Fibre Bragg Grating and a Microstructured Polymer Optical Fibre is presented in light of multi...