7129 search results - page 251 / 1426 » Approximation Algorithms for Treewidth |
133
Voted
ECML
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. Greedy machine learning algorithms suffer from shortsightedness, potentially returning suboptimal models due to limited exploration of the search space. Greedy search mis...
144
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. ...
155
click to vote
ENDM
2010
15 years 4 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...
143
click to vote
SIGDIAL
2010
15 years 2 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...
111
click to vote
EDBT
2008
ACM
16 years 4 months ago
2008
ACM
Users often do not require a complete answer to their query but rather only a sample. They expect the sample to be either the largest possible or the most representative (or both)...