4377 search results - page 79 / 876 » Mass problems and randomness |
AIPS
2004
14 years 11 months ago
2004
We describe and evaluate a system for learning domainspecific control knowledge. In particular, given a planning domain, the goal is to output a control policy that performs well ...
FOCM
2007
14 years 9 months ago
2007
Abstract. We consider the problem of efficient integration of an n-variate polynomial with respect to the Gaussian measure in Rn and related problems of complex integration and opt...
RSA
1998
14 years 9 months ago
1998
We introduce some generalizations of a nice combinatorial problem, the central notion of which is the so-called Disease Process. Let us color independently each square of an n×n c...
SIGECOM
2006
ACM
15 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...
111
click to vote
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...