7930 search results - page 1169 / 1586 » Greedy in Approximation Algorithms |
172
click to vote
ICMLA
2008
15 years 8 months ago
2008
High dimensionality of belief space in Partially Observable Markov Decision Processes (POMDPs) is one of the major causes that severely restricts the applicability of this model. ...
193
click to vote
ICONIP
2008
15 years 8 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...
219
click to vote
IPCO
2008
15 years 8 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...
189
click to vote
IJCAI
2007
15 years 8 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 ...
196
click to vote
IMAMS
2007
15 years 8 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...