134 search results - page 1 / 27 » On the Complexity of Computing Values of Restricted Games |
IJFCS
2002
13 years 5 months ago
2002
ISAAC
2009
Springer
13 years 12 months ago
2009
Springer
We consider some well-known families of two-player zero-sum perfect-information stochastic games played on finite directed graphs. Generalizing and unifying results of Liggett and...
CPC
2002
13 years 5 months ago
2002
We study a model motivated by the minesweeper game. In this model one starts with percolation of mines on the sites of the lattice Zd , and then tries to find an infinite path of ...
PRICAI
2000
Springer
13 years 9 months ago
2000
Springer
The automated prediction of a user's interests and requirements is an area of interest to the Artificial Intelligence community. However, current predictive statistical approa...
CDC
2009
IEEE
13 years 10 months ago
2009
IEEE
Abstract— In this paper, the concept of restricted real perturbation values of a complex matrix triplet is introduced, and a formula for computing lower bounds of these values is...