1772 search results - page 169 / 355 » Classifying Problems into Complexity Classes |
185
click to vote
Publication
Several researchers have recently investigated the connection between reinforcement learning and classification. We are motivated by proposals of approximate policy iteration schem...
125
click to vote
STOC
2010
ACM
15 years 6 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 ...
102
click to vote
WSC
2008
15 years 3 months ago
2008
Approximate dynamic programming is emerging as a powerful tool for certain classes of multistage stochastic, dynamic problems that arise in operations research. It has been applie...
101
click to vote
GECCO
2008
Springer
15 years 2 months ago
2008
Springer
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
117
click to vote
CVPR
2005
IEEE
16 years 3 months ago
2005
IEEE
In earlier work, we proposed treating wide baseline matching of feature points as a classification problem, in which each class corresponds to the set of all possible views of suc...