We consider the problem of computing -approximate Nash equilibria in network congestion games. The general problem is known to be PLS-complete for every > 0, but the reductions...
This study investigated the extent to which the social constructivist approach can be applied to the teaching/learning of translation strategies in an e-learning environment. To a...
Variational methods are frequently used to approximate or bound the partition or likelihood function of a Markov random field. Methods based on mean field theory are guaranteed ...
Erik B. Sudderth, Martin J. Wainwright, Alan S. Wi...
The paper introduces a notion of support for realvalued functions. It is shown how to approximate supports of a large class of functions based on supports of so called polynomial ...
Machine learning with few training examples always leads to over-fitting problems, whereas human individuals are often able to recognize difficult object categories from only one ...