Sciweavers

6110 search results - page 115 / 1222
» Approximate Computing
Sort
View
ECCV
2000
Springer
15 years 10 months ago
Approximate N-View Stereo
This paper introduces a new multi-view reconstruction problem called approximate N -view stereo. The goal of this problem is to recover a oneparameter family of volumes that are in...
Kiriakos N. Kutulakos
AUTOMATICA
2008
104views more  AUTOMATICA 2008»
15 years 6 months ago
Exact finite approximations of average-cost countable Markov decision processes
For a countable-state Markov decision process we introduce an embedding which produces a finite-state Markov decision process. The finite-state embedded process has the same optim...
Arie Leizarowitz, Adam Shwartz
ATAL
2007
Springer
16 years 17 days ago
Constraint satisfaction algorithms for graphical games
We formulate the problem of computing equilibria in multiplayer games represented by arbitrary undirected graphs as a constraint satisfaction problem and present two algorithms. T...
Vishal Soni, Satinder P. Singh, Michael P. Wellman
MOR
2010
106views more  MOR 2010»
15 years 4 months ago
Smoothing Techniques for Computing Nash Equilibria of Sequential Games
We develop first-order smoothing techniques for saddle-point problems that arise in the Nash equilibria computation of sequential games. The crux of our work is a construction of ...
Samid Hoda, Andrew Gilpin, Javier Peña, Tuo...
ENTCS
2006
118views more  ENTCS 2006»
15 years 6 months ago
Domain Theoretic Solutions of Initial Value Problems for Unbounded Vector Fields
This paper extends the domain theoretic method for solving initial value problems, described in [8], to unbounded vector fields. Based on a sequence of approximations of the vecto...
Abbas Edalat, Dirk Pattinson