4908 search results - page 954 / 982 » On the Complexity of Optimal K-Anonymity |
146
click to vote
CRV
2005
IEEE
15 years 1 months ago
2005
IEEE
In robotic navigation, path planning is aimed at getting the optimum collision-free path between a starting and target locations. The optimality criterion depends on the surroundi...
119
Voted
DIALM
2005
ACM
15 years 1 months ago
2005
ACM
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...
107
click to vote
IWMM
2010
Springer
15 years 1 months ago
2010
Springer
The accurate prediction of program's memory requirements is a critical component in software development. Existing heap space analyses either do not take deallocation into ac...
122
click to vote
CLUSTER
2008
IEEE
15 years 1 months ago
2008
IEEE
Efficient intra-node shared memory communication is important for High Performance Computing (HPC), especially with the emergence of multi-core architectures. As clusters continue ...
108
click to vote
CPAIOR
2008
Springer
15 years 1 months ago
2008
Springer
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...