32 search results - page 2 / 7 » On the Maximum Size of the Terms in the Realization of Symme... |
SIGECOM
2010
ACM
14 years 5 days 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...
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
DPOP is an algorithm for distributed constraint optimization which has, as main drawback, the exponential size of some of its messages. Recently, some algorithms for distributed c...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
We consider the problem of estimating the parameters of a Gaussian or binary distribution in such a way that the resulting undirected graphical model is sparse. Our approach is to...
QUESTA
2007
13 years 6 months ago
2007
We present the queueing analysis of a degenerate buffer having access to a single server. This system cannot realize any given delay, but only values that are an integer multiple ...
COCOON
2009
Springer
14 years 1 months ago
2009
Springer
Golumbic et al. [Discrete Applied Mathematics 154(2006) 1465-1477] defined the readability of a monotone Boolean function f to be the minimum integer k such that there exists an ...