4908 search results - page 968 / 982 » On the Complexity of Optimal K-Anonymity |
107
click to vote
JAIR
2008
14 years 11 months ago
2008
Several multiagent reinforcement learning (MARL) algorithms have been proposed to optimize agents' decisions. Due to the complexity of the problem, the majority of the previo...
CORR
2007
Springer
14 years 11 months ago
2007
Springer
We introduce S-DUDE, a new algorithm for denoising Discrete Memoryless Channel (DMC)-corrupted data. The algorithm, which generalizes the recently introduced DUDE (Discrete Univer...
116
click to vote
CORR
2007
Springer
14 years 11 months ago
2007
Springer
— In this paper we study different options for the survivability implementation in MPLS over Optical Transport Networks (OTN) in terms of network resource usage and configuratio...
114
click to vote
JMLR
2008
14 years 11 months ago
2008
We consider the problem of learning classifiers in structured domains, where some objects have a subset of features that are inherently absent due to complex relationships between...
101
click to vote
JACM
2006
14 years 11 months ago
2006
"Experts algorithms" constitute a methodology for choosing actions repeatedly, when the rewards depend both on the choice of action and on the unknown current state of t...