134 search results - page 18 / 27 » On the Complexity of Computing Values of Restricted Games |
MST
2011
13 years 2 months ago
2011
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
SOFSEM
2007
Springer
14 years 1 months ago
2007
Springer
Digital technology is increasingly deployed in safety-critical situations. This calls for systematic design and verification methodologies that can cope with three major sources o...
STOC
2010
ACM
14 years 18 days ago
2010
ACM
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
ATAL
2004
Springer
14 years 1 months ago
2004
Springer
Partially observable decentralized decision making in robot teams is fundamentally different from decision making in fully observable problems. Team members cannot simply apply si...