4860 search results - page 315 / 972 » SNPs Problems, Complexity, and Algorithms |
CORR
2010
Springer
15 years 27 days ago
2010
Springer
We study online learnability of a wide class of problems, extending the results of [26] to general notions of performance measure well beyond external regret. Our framework simult...
90
Voted
AIPS
2006
15 years 2 months ago
2006
Classical planning algorithms require that their operators be simple in order for planning to be tractable. However, the complexities of real world domains suggest that, in order ...
99
Voted
CCGRID
2008
IEEE
15 years 7 months ago
2008
IEEE
In this paper we present a multicost algorithm for the joint time scheduling of the communication and computation resources that will be used by a task. The proposed algorithm sel...
COLT
2005
Springer
15 years 6 months ago
2005
Springer
We start by showing that in an active learning setting, the Perceptron algorithm needs Ω( 1 ε2 ) labels to learn linear separators within generalization error ε. We then prese...
91
Voted
GECCO
2006
Springer
15 years 4 months ago
2006
Springer
We present two novel perturbation-based linkage learning algorithms that extend LINC [5]; a version of LINC optimised for decomposition tasks (oLINC) and a hierarchical version of...