7129 search results - page 999 / 1426 » Approximation Algorithms for Treewidth |
147
click to vote
ICONIP
2008
15 years 6 months ago
2008
Abstract. The concept of Ensemble Learning has been shown to increase predictive power over single base learners. Given the bias-variancecovariance decomposition, diversity is char...
172
Voted
IPCO
2008
15 years 6 months ago
2008
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
141
Voted
IJCAI
2007
15 years 6 months ago
2007
Coalition formation is a problem of great interest in AI, allowing groups of autonomous, individually rational agents to form stable teams. Automating the negotiations underlying ...
155
Voted
IMAMS
2007
15 years 6 months ago
2007
In this paper, we consider the problem of analysing the shape of an object defined by polynomial equations in a domain. We describe regularity criteria which allow us to determine...
144
Voted
NIPS
2008
15 years 6 months ago
2008
We show that an important and computationally challenging solution space feature of the graph coloring problem (COL), namely the number of clusters of solutions, can be accurately...