192 search results - page 3 / 39 » Complexity Bounds for Regular Games |
COCOON
2008
Springer
13 years 7 months ago
2008
Springer
We analyze the complexity of equilibria problems for a class of strategic zero-sum games, called Angel-Daemon games. Those games were introduced to asses the goodness of a web or g...
ESA
2005
Springer
13 years 11 months ago
2005
Springer
FSTTCS
2003
Springer
13 years 10 months ago
2003
Springer
We consider infinitary two-player perfect information games defined over graphs of configurations of a pushdown automaton. We show how to solve such games when winning condition...
ENTCS
2000
13 years 5 months ago
2000
It is an open problem whether weak bisimilarity is decidable for Basic Process Algebra (BPA) and Basic Parallel Processes (BPP). A PSPACE lower bound for BPA and NP lower bound fo...
NIPS
1996
13 years 6 months ago
1996
In this paper we apply the method of complexity regularization to derive estimation bounds for nonlinear function estimation using a single hidden layer radial basis function netwo...