800 search results - page 64 / 160 » On the Complexity of Parity Games |
PRICAI
2000
Springer
14 years 23 days 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...
APAL
2008
13 years 9 months ago
2008
We show that for random bit strings, Up(n), with probability, p = 1 2 , the firstorder quantifier depth D(Up(n)) needed to distinguish non-isomorphic structures is (lg lg n), with...
GLOBECOM
2006
IEEE
14 years 3 months ago
2006
IEEE
Abstract— In this paper, we investigate the application of nonbinary low density parity check (LDPC) codes over Galois field GF(q) for both single-input single-output (SISO) and...
HICSS
2010
IEEE
14 years 4 months ago
2010
IEEE
Network security is a complex and challenging problem. The area of network defense mechanism design is receiving immense attention from the research community for more than two de...
SIGECOM
2006
ACM
14 years 3 months ago
2006
ACM
We present a reduction from graphical games to Markov random fields so that pure Nash equilibria in the former can be found by statistical inference on the latter. Our result, wh...