Sciweavers

2745 search results - page 91 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
148
Voted
ATAL
2011
Springer
14 years 3 months ago
Game theory-based opponent modeling in large imperfect-information games
We develop an algorithm for opponent modeling in large extensive-form games of imperfect information. It works by observing the opponent’s action frequencies and building an opp...
Sam Ganzfried, Tuomas Sandholm
128
Voted
ISSAC
2005
Springer
97views Mathematics» more  ISSAC 2005»
15 years 9 months ago
Probabilistic algorithms for computing resultants
Let A and B be two polynomials in   [x,y] and let R = resx(A, B) denote the resultant of A and B taken wrt x. In this paper we modify Collins’ modular algorithm for computing R...
Michael B. Monagan
126
Voted
UIST
2010
ACM
15 years 1 months ago
TurKit: human computation algorithms on mechanical turk
Mechanical Turk provides an on-demand source of human computation. This provides a tremendous opportunity to explore algorithms which incorporate human computation as a function c...
Greg Little, Lydia B. Chilton, Max Goldman, Robert...
113
Voted
ICDIM
2007
IEEE
15 years 10 months ago
Fast Send Protocol - minimizing sending time in high-speed bulk data transfers
Over the last decades Internet traffic has grown dramatically. Besides the number of transfers, data sizes have risen as well. Traditional transfer protocols do not adapt to this...
Christoph Koch, Tilmann Rabl, Günther Hö...
120
Voted
EUROPAR
2008
Springer
15 years 5 months ago
Fault-Tolerant Partial Replication in Large-Scale Database Systems
We investigate a decentralised approach to committing transactions in a replicated database, under partial replication. Previous protocols either reexecute transactions entirely an...
Pierre Sutra, Marc Shapiro