4908 search results - page 176 / 982 » On the Complexity of Optimal K-Anonymity |
149
click to vote
ICPR
2004
IEEE
16 years 7 months ago
2004
IEEE
Feature and structure selection is an important part of many classification problems. In previous papers, an approach called basis pursuit classification has been proposed which p...
233
click to vote
EVOW
2009
Springer
16 years 1 months ago
2009
Springer
This paper proposes a discrete particle swarm optimization (DPSO) to solve the multiple destination routing (MDR) problems. The problem has been proven to be NP-complete and the tr...
163
click to vote
IAT
2009
IEEE
16 years 1 months ago
2009
IEEE
Application of autonomous intelligent systems into airspace domain is very important nowadays. The paper presents decentralized collision avoidance algorithm utilizing a solution ...
182
click to vote
ICC
2009
IEEE
16 years 1 months ago
2009
IEEE
—We consider a system with a single base station communicating with multiple users over orthogonal channels while being assisted by multiple relays. Several recent works have sug...
186
click to vote
ICARCV
2008
IEEE
16 years 29 days ago
2008
IEEE
— We investigate the use of Particle Swarm Optimization (PSO), and compare with Genetic Algorithms (GA), for a particular robot behavior-learning task: the training of an animat ...