1615 search results - page 50 / 323 » Computer science and decision theory |
107
click to vote
FOCS
2010
IEEE
14 years 9 months ago
2010
IEEE
Complexity theory typically studies the complexity of computing a function h(x) : {0, 1}m {0, 1}n of a given input x. A few works have suggested to study the complexity of genera...
STACS
2009
Springer
15 years 6 months ago
2009
Springer
We extend the notion of randomness (in the version introduced by Schnorr) to computable Probability Spaces and compare it to a dynamical notion of randomness: typicality. Roughly, ...
CSE
2009
IEEE
15 years 6 months ago
2009
IEEE
—We propose a parallel algorithm for finding Nash equilibria in n-player noncooperative games. The algorithm is based on enumerating the supports of mixed strategies in parallel...
260
click to vote
Tutorial
"These video lectures provide a thorough and unified treatment of adaptive filters and their performance. The lectures cover the fundamentals of linear estimation theory, adap...
115
click to vote
ENC
2004
IEEE
15 years 3 months ago
2004
IEEE
Despite the relevance of the belief-desire-intention (BDI) model of rational agency, little work has been done to deal with its two main limitations: the lack of learning competen...