4908 search results - page 826 / 982 » On the Complexity of Optimal K-Anonymity |
184
click to vote
CEC
2010
IEEE
15 years 6 months ago
2010
IEEE
Abstract— In Evolutionary Robotics (ER), explicitly rewarding for behavioral diversity recently revealed to generate efficient results without recourse to complex fitness funct...
187
click to vote
DSD
2010
IEEE
15 years 6 months ago
2010
IEEE
—Since many embedded systems execute a predefined set of programs, tuning system components to application programs and data is the approach chosen by many design techniques to o...
183
click to vote
SMA
2010
ACM
15 years 6 months ago
2010
ACM
Designing a fixture layout of an object can be reduced to computing the largest simplex and the resulting simplex is classified using the radius of the largest inscribed ball cent...
160
click to vote
ICASSP
2010
IEEE
15 years 6 months ago
2010
IEEE
This paper considers the problem of distributed source coding for a large sensor network. A typical shortcoming of current approaches to true distributed coding is the exponential...
187
click to vote
GLOBECOM
2008
IEEE
15 years 6 months ago
2008
IEEE
Abstract-- We study the problem of total throughput maximization in arbitrary multi-hop wireless networks, with constraints on the total power usage (denoted by PETM), when nodes h...