780 search results - page 11 / 156 » Cost-Sharing Approximations for h |
NIPS
2001
13 years 8 months ago
2001
We address two open theoretical questions in Policy Gradient Reinforcement Learning. The first concerns the efficacy of using function approximation to represent the state action ...
FOCS
1995
IEEE
13 years 10 months ago
1995
IEEE
We consider the special case of the traveling salesman problem TSP in which the distance metric is the shortest-path metric of a planar unweighted graph. We present a polynomial...
ECCC
2010
13 years 6 months ago
2010
We investigate the complexity of the following computational problem: Polynomial Entropy Approximation (PEA): Given a low-degree polynomial mapping p : Fn Fm , where F is a finite...
QUESTA
2010
13 years 5 months ago
2010
: We develop power series approximations for a discrete-time queueing system with two parallel queues and one processor. If both queues are non-empty, a customer of queue 1 is serv...
SAT
2007
Springer
14 years 25 days ago
2007
Springer
Abstract. We consider the problem of computing tractable approximations to CNF formulas, extending the approach of Selman and Kautz to compute the Horn-LUB to involve renaming of v...