494 search results - page 26 / 99 » Polynomial Equivalence Problems: Algorithmic and Theoretical... |
AAAI
2006
13 years 9 months ago
2006
Significant work has been done on computational aspects of solving games under various solution concepts, such as Nash equilibrium, subgame perfect Nash equilibrium, correlated eq...
CASES
2004
ACM
14 years 1 months ago
2004
ACM
Many optimization techniques, including several targeted specifically at embedded systems, depend on the ability to calculate the number of elements that satisfy certain conditio...
ICML
1996
IEEE
14 years 8 months ago
1996
IEEE
Within Valiant'smodel of learning as formalized by Kearns, we show that computable total predicates for two formallyuncomputable problems the classical Halting Problem, and t...
IWPEC
2009
Springer
14 years 2 months ago
2009
Springer
In the p-Set Splitting problem we are given a universe U, a family F of subsets of U and a positive integer k and the objective is to find a partition of U into W and B such that...
ICML
2007
IEEE
14 years 8 months ago
2007
IEEE
Inference tasks in Markov random fields (MRFs) are closely related to the constraint satisfaction problem (CSP) and its soft generalizations. In particular, MAP inference in MRF i...