10054 search results - page 20 / 2011 » On the Complexity of Function Learning |
CORR
2006
Springer
13 years 10 months ago
2006
Springer
We consider the problem of decision-making with side information and unbounded loss functions. Inspired by probably approximately correct learning model, we use a slightly differe...
AAAI
2006
13 years 11 months ago
2006
While computers have defeated the best human players in many classic board games, progress in Go remains elusive. The large branching factor in the game makes traditional adversar...
EVOW
2008
Springer
13 years 11 months ago
2008
Springer
In this paper we study a complex real world workforce scheduling problem. We apply constructive search and variable neighbourhood search (VNS) metaheuristics and enhance these meth...
SG
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. Co-referential relations between textual and visual elements in illustrations can be encoded efficiently through textual labels. The labels support students to learn unk...
NIPS
2007
13 years 11 months ago
2007
Clustering is often formulated as a discrete optimization problem. The objective is to find, among all partitions of the data set, the best one according to some quality measure....