999 search results - page 104 / 200 » On the Decidability of Functional Uncertainty |
SIGECOM
2010
ACM
14 years 1 months ago
2010
ACM
We analyze the complexity of computing pure strategy Nash equilibria (PSNE) in symmetric games with a fixed number of actions. We restrict ourselves to “compact” representati...
EUROCOLT
1999
Springer
14 years 1 months ago
1999
Springer
We study the learnability of first order Horn expressions from equivalence and membership queries. We show that the class of expressions where every term in the consequent of a c...
EVOTING
2004
13 years 10 months ago
2004
: One of the basic principles of architecture is that of the relation between function and form. It is a common fact that in most cases form reveals or refers to function. Thus by ...
JSAC
2007
13 years 8 months ago
2007
— A cross-layer packet scheduling scheme that streams pre-encoded video over wireless downlink packet access networks to multiple users is presented. The scheme can be used with ...
ICDT
2009
ACM
14 years 9 months ago
2009
ACM
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...