Sciweavers

533 search results - page 43 / 107
» Playing games with approximation algorithms
Sort
View
SIAMCO
2002
71views more  SIAMCO 2002»
13 years 7 months ago
Rate of Convergence for Constrained Stochastic Approximation Algorithms
There is a large literature on the rate of convergence problem for general unconstrained stochastic approximations. Typically, one centers the iterate n about the limit point then...
Robert Buche, Harold J. Kushner
BMCBI
2010
112views more  BMCBI 2010»
13 years 7 months ago
A boundary delimitation algorithm to approximate cell soma volumes of bipolar cells from topographical data obtained by scanning
Background: Cell volume determination plays a pivotal role in the investigation of the biophysical mechanisms underlying various cellular processes. Whereas light microscopy in pr...
Patrick Happel, Kerstin Moller, Ralf Kunz, Irmgard...
STOC
2004
ACM
109views Algorithms» more  STOC 2004»
14 years 8 months ago
Approximating the cut-norm via Grothendieck's inequality
The cut-norm ||A||C of a real matrix A = (aij)iR,jS is the maximum, over all I R, J S of the quantity | iI,jJ aij|. This concept plays a major role in the design of efficient app...
Noga Alon, Assaf Naor
CORR
2010
Springer
115views Education» more  CORR 2010»
13 years 7 months ago
The complexity of solving reachability games using value and strategy iteration
Concurrent reachability games is a class of games heavily studied by the computer science community, in particular by the formal methods community. Two standard algorithms for app...
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, P...
SIGECOM
2010
ACM
154views ECommerce» more  SIGECOM 2010»
14 years 15 days ago
Ranking games that have competitiveness-based strategies
This paper studies —from the perspective of efficient computation— a type of competition that is widespread throughout the plant and animal kingdoms, higher education, politic...
Leslie Ann Goldberg, Paul W. Goldberg, Piotr Kryst...