27336 search results - page 5245 / 5468 » Changing the subject: on the subject of subjectivity |
210
click to vote
SIAMCOMP
1998
15 years 6 months ago
1998
We initiate an investigation of general fault-tolerant distributed computation in the full-information model. In the full information model no restrictions are made on the computat...
196
Voted
SIAMCOMP
1998
15 years 6 months ago
1998
Polynomial-time safe and unsafe approximations for intractable sets were introduced by Meyer and Paterson [Technical Report TM-126, Laboratory for Computer Science, MIT, Cambridge,...
196
click to vote
SAC
2002
ACM
15 years 6 months ago
2002
ACM
Distributed cooperative engineering applications require consistent and long-term sharing of large volumes of data, which may cause conflicts due to concurrent read/write operatio...
161
click to vote
SIAMCOMP
2002
15 years 6 months ago
2002
Abstract. In the multiarmed bandit problem, a gambler must decide which arm of K nonidentical slot machines to play in a sequence of trials so as to maximize his reward. This class...
180
click to vote
SIAMCOMP
2002
15 years 6 months ago
2002
We consider the problem of maintaining aggregates and statistics over data streams, with respect to the last N data elements seen so far. We refer to this model as the sliding wind...