Sciweavers

163 search results - page 25 / 33
» Solving Simple Stochastic Games
Sort
View
SIAMCOMP
2002
124views more  SIAMCOMP 2002»
13 years 7 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...
ICML
2007
IEEE
14 years 8 months ago
Pegasos: Primal Estimated sub-GrAdient SOlver for SVM
We describe and analyze a simple and effective iterative algorithm for solving the optimization problem cast by Support Vector Machines (SVM). Our method alternates between stocha...
Shai Shalev-Shwartz, Yoram Singer, Nathan Srebro
SIGECOM
2011
ACM
232views ECommerce» more  SIGECOM 2011»
12 years 10 months ago
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
Nikhil R. Devanur, Kamal Jain, Balasubramanian Siv...
ICIDS
2010
Springer
13 years 5 months ago
Emohawk: Learning Virtual Characters by Doing
Emohawk is a narrative-based serious game designed to be a supportive tool for teaching basics of virtual agents development at universities and high-schools. Emohawk is built util...
Michal Bída, Cyril Brom
ECAL
2003
Springer
14 years 28 days ago
Caring versus Sharing: How to Maintain Engagement and Diversity in Coevolving Populations
Coevolutionary optimisation suffers from a series of problems that interfere with the progressive escalating arms races that are hoped might solve difficult classes of optimisatio...
John Cartlidge, Seth Bullock