1207 search results - page 89 / 242 » Towards optimal k-anonymization |
114
Voted
STOC
2005
ACM
16 years 1 months ago
2005
ACM
Abstract. We present a deterministic O(log n log log n) space algorithm for undirected stconnectivity. It is based on a space-efficient simulation of the deterministic EREW algorit...
81
Voted
PPSN
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. A two-population Genetic Algorithm for constrained optimization is exercised and analyzed. One population consists of feasible candidate solutions evolving toward optimal...
AAAI
2008
15 years 3 months ago
2008
We address the problem of effective reuse of subproblem solutions in dynamic programming. In dynamic programming, a memoed solution of a subproblem can be reused for another if th...
103
Voted
AAAI
2000
15 years 2 months ago
2000
Iterative auctions have many computational advantages over sealed-bid auctions, but can present new possibilities for strategic manipulation. We propose a two-stage technique to m...
153
Voted
JMLR
2010
14 years 7 months ago
2010
With the goal to generate more scalable algorithms with higher efficiency and fewer open parameters, reinforcement learning (RL) has recently moved towards combining classical tec...