Sciweavers

163 search results - page 14 / 33
» Solving Simple Stochastic Games
Sort
View
EMMCVPR
2001
Springer
14 years 6 days ago
Matching Free Trees, Maximal Cliques, and Monotone Game Dynamics
—Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an associati...
Marcello Pelillo
JMLR
2010
161views more  JMLR 2010»
13 years 2 months ago
Dual Averaging Methods for Regularized Stochastic Learning and Online Optimization
We consider regularized stochastic learning and online optimization problems, where the objective function is the sum of two convex terms: one is the loss function of the learning...
Lin Xiao
CEC
2008
IEEE
14 years 2 months ago
A contour method in population-based stochastic algorithms
—Inspired by the contours in topography, this paper proposes a contour method for the population-based stochastic algorithms to solve the problems with continuous variables. Rely...
Ying Lin, Jun Zhang, Lu-kai Lan
CORR
2010
Springer
146views Education» more  CORR 2010»
13 years 7 months ago
Adaptive Submodularity: A New Approach to Active Learning and Stochastic Optimization
Solving stochastic optimization problems under partial observability, where one needs to adaptively make decisions with uncertain outcomes, is a fundamental but notoriously diffic...
Daniel Golovin, Andreas Krause
CGF
1999
79views more  CGF 1999»
13 years 7 months ago
Stochastic Iteration for Non-diffuse Global Illumination
This paper presents a single-pass, view-dependent method to solve the rendering equation, using a stochastic iterational scheme where the transport operator is selected randomly i...
László Szirmay-Kalos