AMAI
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. This paper is concerned with the reliable inference of optimal treeapproximations to the dependency structure of an unknown distribution generating data. The traditional ...
AMAI
2005
Springer
13 years 11 months ago
2005
Springer
AMAI
2005
Springer
13 years 11 months ago
2005
Springer
AMAI
2005
Springer
13 years 11 months ago
2005
Springer
A CNF formula is called matched if its associated bipartite graph (whose vertices are clauses and variables) has a matching that covers all clauses. Matched CNF formulas are satisf...
AMAI
2005
Springer
13 years 11 months ago
2005
Springer
SAT Competition 2002 held in March
AMAI
2005
Springer
13 years 11 months ago
2005
Springer
Mediator systems integrate distributed, heterogeneous and autonomous data sources, but their e ective use requires the solution of hard query optimization problems. This is usuall...
AMAI
2005
Springer
13 years 11 months ago
2005
Springer
We consider auction design in a setting with costly preference elicitation. Well designed auctions can help to avoid unnecessary elicitation while determining efficient allocations...
AMAI
2005
Springer
13 years 11 months ago
2005
Springer
Many algorithms for Boolean satisfiability (SAT) work within the framework of resolution as a proof system, and thus on unsatisfiable instances they can be viewed as attempting to...
AMAI
2005
Springer
13 years 11 months ago
2005
Springer
AMAI
2005
Springer
13 years 11 months ago
2005
Springer
Binary-clause reasoning has been shown to reduce the size of the search space on many satisfiability problems, but has often been so expensive that run-time was higher than that o...