Sciweavers

1308 search results - page 63 / 262
» Bayesian Algorithmic Mechanism Design
Sort
View
PODC
2004
ACM
15 years 10 months ago
Group membership: a novel approach and the first single-round algorithm
We establish a new worst-case upper bound on the Membership problem: We present a simple algorithm that is able to always achieve Agreement on Views within a single message latenc...
Roger I. Khazan
AAAI
2010
15 years 6 months ago
Reinforcement Learning via AIXI Approximation
This paper introduces a principled approach for the design of a scalable general reinforcement learning agent. This approach is based on a direct approximation of AIXI, a Bayesian...
Joel Veness, Kee Siong Ng, Marcus Hutter, David Si...
ACL
2001
15 years 6 months ago
Automated Subcategorization of Named Entities
There has been much interest in the recent past concerning the possibilities for automated categorization of named entities. The research presented here describes a method for the...
Michael Fleischman
TIP
1998
129views more  TIP 1998»
15 years 4 months ago
Minimax partial distortion competitive learning for optimal codebook design
— The design of the optimal codebook for a given codebook size and input source is a challenging puzzle that remains to be solved. The key problem in optimal codebook design is h...
Ce Zhu, Lai-Man Po
SIGOPSE
2000
ACM
15 years 9 months ago
An algorithm for stabilising multiple stores
The algorithm for stabilising multiple stores, which we present in this paper, was developed in the process of designing the global stability and resilience mechanism for Grasshopp...
Ewa Z. Bem, John Rosenberg