7015 search results - page 234 / 1403 » Approximation algorithms for co-clustering |
185
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...
180
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...
128
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)...
155
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
Indicator-based algorithms have become a very popular approach to solve multi-objective optimization problems. In this paper, we contribute to the theoretical understanding of alg...
167
click to vote
SODA
2000
ACM
15 years 7 months ago
2000
ACM
The Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices terminals. We present a new polynomial-time heurist...