2957 search results - page 136 / 592 » The Complexity of Polynomial-Time Approximation |
162
click to vote
ATAL
2007
Springer
15 years 11 months ago
2007
Springer
It is known that the complexity of the reinforcement learning algorithms, such as Q-learning, may be exponential in the number of environment’s states. It was shown, however, th...
139
click to vote
MOBIHOC
2003
ACM
16 years 4 months ago
2003
ACM
In this paper, we address the problem of energy-conscious cache placement in wireless ad hoc networks. We consider a network comprising a server with an interface to the wired net...
138
Voted
FOCS
2002
IEEE
15 years 10 months ago
2002
IEEE
We give the first polynomial time algorithm to learn any function of a constant number of halfspaces under the uniform distribution on the Boolean hypercube to within any constan...
167
click to vote
ATAL
2010
Springer
15 years 6 months ago
2010
Springer
Decentralized POMDPs provide an expressive framework for sequential multi-agent decision making. Despite their high complexity, there has been significant progress in scaling up e...
145
click to vote
APPROX
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. We address the problems of pattern matching and approximate pattern matching in the sketching model. We show that it is impossible to compress the text into a small sketc...