Sciweavers

9716 search results - page 248 / 1944
» The Case for Energy-Proportional Computing
Sort
View
ML
2002
ACM
121views Machine Learning» more  ML 2002»
15 years 6 months ago
Near-Optimal Reinforcement Learning in Polynomial Time
We present new algorithms for reinforcement learning, and prove that they have polynomial bounds on the resources required to achieve near-optimal return in general Markov decisio...
Michael J. Kearns, Satinder P. Singh
TIT
2002
116views more  TIT 2002»
15 years 6 months ago
On delayed prediction of individual sequences
Prediction of individual sequences is investigated for cases in which the decision maker observes a delayed version of the sequence, or is forced to issue his/her predictions a nu...
Marcelo J. Weinberger, Erik Ordentlich
STOC
2010
ACM
227views Algorithms» more  STOC 2010»
15 years 11 months ago
On the Round Complexity of Covert Computation
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
Vipul Goyal and Abhishek Jain
DAGSTUHL
2007
15 years 8 months ago
07431 Executive Summary - Computational Issues in Social Choice
Computational social choice is an interdisciplinary eld of study at the interface of social choice theory and computer science, with knowledge owing in either direction. On the o...
Ulle Endriss, Jérôme Lang, Francesca ...
GPC
2007
Springer
15 years 10 months ago
A Design of Cooperation Management System to Improve Reliability in Resource Sharing Computing Environment
Resource sharing computing is a project that realizes high performance computing by utilizing the resources of peers that are connected to the Internet. Resource sharing computing ...
Ji Su Park, Kwang-Sik Chung, Jin Gon Shon