53 search results - page 11 / 11 » Backdoors to Combinatorial Optimization: Feasibility and Opt... |
UAI
1997
13 years 6 months ago
1997
This paper describes a class ofprobabilistic approximation algorithms based on bucket elimination which o er adjustable levels of accuracy ande ciency. We analyzethe approximation...
ECR
2007
13 years 4 months ago
2007
In the everyday business world, the sourcing process of multiple goods and services usually involves complex negotiations (via telephone, fax, etc) that include discussion of prod...
JMLR
2002
13 years 4 months ago
2002
This paper introduces the problem of combining multiple partitionings of a set of objects into a single consolidated clustering without accessing the features or algorithms that d...