7930 search results - page 351 / 1586 » Greedy in Approximation Algorithms |
206
click to vote
SOFSEM
2007
Springer
16 years 24 days ago
2007
Springer
We investigate randomised algorithms for subset matching with spatial point sets—given two sets of d-dimensional points: a data set T consisting of n points and a pattern P consi...
185
Voted
NIPS
2003
15 years 8 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. ...
188
click to vote
ENDM
2010
15 years 6 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...
183
click to vote
SIGDIAL
2010
15 years 4 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...
129
click to vote
EDBT
2008
ACM
16 years 6 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)...