4908 search results - page 685 / 982 » On the Complexity of Optimal K-Anonymity |
175
click to vote
GECCO
2007
Springer
16 years 27 days ago
2007
Springer
This research screens the tuning parameters of a combinatorial optimization heuristic. Specifically, it presents a Design of Experiments (DOE) approach that uses a Fractional Fac...
177
Voted
CODES
2006
IEEE
16 years 24 days ago
2006
IEEE
The use of Application Specific Instruction-set Processors (ASIP) is a solution to the problem of increasing complexity in embedded systems design. One of the major challenges in...
184
click to vote
ICRA
2006
IEEE
16 years 23 days ago
2006
IEEE
— We explore an online problem where a group of robots has to find a target whose position is unknown in an unknown planar environment whose geometry is acquired by the robots d...
203
Voted
CGO
2005
IEEE
16 years 11 days ago
2005
IEEE
Software code caches are becoming ubiquitous, in dynamic optimizers, runtime tool platforms, dynamic translators, fast simulators and emulators, and dynamic compilers. Caching fre...
184
click to vote
SENSYS
2005
ACM
16 years 9 days ago
2005
ACM
Increasing user comfort and reducing operation costs have always been two primary objectives of building operations and control strategies. Current building control strategies are...