Sciweavers

188 search results - page 20 / 38
» Finding Best k Policies
Sort
View
JAIR
2008
130views more  JAIR 2008»
13 years 9 months ago
Online Planning Algorithms for POMDPs
Partially Observable Markov Decision Processes (POMDPs) provide a rich framework for sequential decision-making under uncertainty in stochastic domains. However, solving a POMDP i...
Stéphane Ross, Joelle Pineau, Sébast...
CCS
2010
ACM
13 years 10 months ago
@spam: the underground on 140 characters or less
In this work we present a characterization of spam on Twitter. We find that 8% of 25 million URLs posted to the site point to phishing, malware, and scams listed on popular blackl...
Chris Grier, Kurt Thomas, Vern Paxson, Michael Zha...
SIAMCOMP
2002
124views more  SIAMCOMP 2002»
13 years 9 months ago
The Nonstochastic Multiarmed Bandit Problem
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...
Peter Auer, Nicolò Cesa-Bianchi, Yoav Freun...
CSMR
2008
IEEE
14 years 4 months ago
Aligning Software Maintenance to the Offshore Reality
With an ever-increasing amount of software in place, the importance and ubiquity of software maintenance is continuously growing. Another more recent trend is to “offshore” su...
Christian Seybold, Rudolf K. Keller
MICRO
2010
IEEE
140views Hardware» more  MICRO 2010»
13 years 7 months ago
STEM: Spatiotemporal Management of Capacity for Intra-core Last Level Caches
Efficient management of last level caches (LLCs) plays an important role in bridging the performance gap between processor cores and main memory. This paper is motivated by two key...
Dongyuan Zhan, Hong Jiang, Sharad C. Seth