1464 search results - page 197 / 293 » On optimal anonymization for l -diversity |
163
click to vote
NIPS
2007
15 years 7 months ago
2007
We present an algorithm called Optimistic Linear Programming (OLP) for learning to optimize average reward in an irreducible but otherwise unknown Markov decision process (MDP). O...
146
click to vote
ERSA
2006
15 years 7 months ago
2006
Reconfigurable supercomputing (RSC) combines programmable logic chips with high performance microprocessors, all communicating over a high bandwidth, low latency interconnection n...
153
click to vote
NIPS
2001
15 years 7 months ago
2001
Policy gradient methods for reinforcement learning avoid some of the undesirable properties of the value function approaches, such as policy degradation (Baxter and Bartlett, 2001...
187
click to vote
BIOCOMP
2009
2009
Improving Remote Homology Detection Using Sequence Properties and Position Specific Scoring Matrices
15 years 7 months ago
Current biological sequence comparison tools frequently fail to recognize matches between homologs when sequence similarity is below the twilight zone of less than 25% sequence id...
198
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
Pair approximations have often been used to predict equilibrium conditions in spatially-explicit epidemiological and ecological systems. In this work, we investigate whether this ...