DISOPT
2008
13 years 4 months ago
2008
At present, the most successful approach to solving large-scale instances of the Symmetric Traveling Salesman Problem to optimality is branch-and-cut. The success of branch-and-cu...
SODA
2008
ACM
13 years 6 months ago
2008
ACM
Approximation of the permanent of a matrix with nonnegative entries is a well studied problem. The most successful approach to date for general matrices uses Markov chains to appr...
ICDM
2006
IEEE
13 years 10 months ago
2006
IEEE
Although version space support vector machines (VSSVMs) are a successful approach to reliable classification [6], they are restricted to separable data. This paper proposes gener...