192 search results - page 22 / 39 » Complexity Bounds for Regular Games |
DIALM
2003
ACM
14 years 1 months ago
2003
ACM
We study topology control problems in ad hoc networks, where network nodes get to choose their power levels in order to ensure desired connectivity properties. Unlike most other w...
CHARME
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. We define and study a quantitative generalization of the traditional boolean framework of model-based specification and verification. In our setting, propositions have...
LICS
2009
IEEE
14 years 3 months ago
2009
IEEE
We consider the standard model of finite two-person zero-sum stochastic games with signals. We are interested in the existence of almost-surely winning or positively winning stra...
SIAMCOMP
2008
13 years 8 months ago
2008
XML specifications often consist of a type definition (typically, a DTD) and a set of integrity constraints. It has been shown previously that such specifications can be inconsiste...
MICAI
2005
Springer
14 years 2 months ago
2005
Springer
Although undirected cycles in directed graphs of Bayesian belief networks have been thoroughly studied, little attention has so far been given to a systematic analysis of directed ...