7006 search results - page 244 / 1402 » Approximation Algorithms |
139
click to vote
NIPS
2003
15 years 5 months ago
2003
Recent research has demonstrated that useful POMDP solutions do not require consideration of the entire belief space. We extend this idea with the notion of temporal abstraction. ...
150
Voted
ENDM
2010
15 years 3 months ago
2010
Abstract We study the version of the asymmetric prize collecting traveling salesman problem, where the objective is to find a directed tour that visits a subset of vertices such th...
137
Voted
SIGDIAL
2010
15 years 1 months ago
2010
Spoken dialogue management strategy optimization by means of Reinforcement Learning (RL) is now part of the state of the art. Yet, there is still a clear mismatch between the comp...
116
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We introduce a new approach to computing an approximately maximum s-t flow in a capacitated, undirected graph. This flow is computed by solving a sequence of electrical flow probl...
141
Voted
RCIS
2010
15 years 2 months ago
2010
—The strategies for mining frequent itemsets, which is the essential part of discovering association rules, have been widely studied over the last decade. In real-world datasets,...