Sciweavers

837 search results - page 28 / 168
» Distributed algorithms for reaching consensus on general fun...
Sort
View
PODC
2004
ACM
14 years 1 months ago
Byzantine disk paxos: optimal resilience with byzantine shared memory
We present Byzantine Disk Paxos, an asynchronous shared-memory consensus algorithm that uses a collection of n > 3t disks, t of which may fail by becoming non-responsive or arb...
Ittai Abraham, Gregory Chockler, Idit Keidar, Dahl...
KDD
2009
ACM
178views Data Mining» more  KDD 2009»
14 years 8 months ago
Catching the drift: learning broad matches from clickthrough data
Identifying similar keywords, known as broad matches, is an important task in online advertising that has become a standard feature on all major keyword advertising platforms. Eff...
Sonal Gupta, Mikhail Bilenko, Matthew Richardson
ATAL
2008
Springer
13 years 9 months ago
Artificial agents learning human fairness
Recent advances in technology allow multi-agent systems to be deployed in cooperation with or as a service for humans. Typically, those systems are designed assuming individually ...
Steven de Jong, Karl Tuyls, Katja Verbeeck
WSC
2000
13 years 9 months ago
Simulation from non-standard distributions using envelope methods
This paper considers the development of envelope methods as a tool for simulation. Envelope methods are based on the construction of simple envelopes to functions. The proposed en...
Michael J. Evans, Tim B. Swartz
FOCM
2006
50views more  FOCM 2006»
13 years 7 months ago
Online Learning Algorithms
In this paper, we study an online learning algorithm in Reproducing Kernel Hilbert Spaces (RKHS) and general Hilbert spaces. We present a general form of the stochastic gradient m...
Steve Smale, Yuan Yao