2957 search results - page 290 / 592 » The Complexity of Polynomial-Time Approximation |
192
Voted
STOC
2010
ACM
15 years 11 months ago
2010
ACM
There has been much progress on geometric set cover problems, but most known techniques only apply to the unweighted setting. For the weighted setting, very few results are known ...
184
click to vote
FLAIRS
2007
15 years 9 months ago
2007
POMDPs are a popular framework for representing decision making problems that contain uncertainty. The high computational complexity of finding exact solutions to POMDPs has spaw...
193
click to vote
NIPS
2008
15 years 8 months ago
2008
In this paper we consider approximate policy-iteration-based reinforcement learning algorithms. In order to implement a flexible function approximation scheme we propose the use o...
169
click to vote
NIPS
2004
15 years 8 months ago
2004
This paper proposes a method for computing fast approximations to support vector decision functions in the field of object detection. In the present approach we are building on an...
170
click to vote
ACTA
2007
15 years 6 months ago
2007
Abstract In this article, we describe some recent results on the hybridization methods for the analysis of nonlinear systems. The main idea of our hybridization approach is to appl...