6894 search results - page 73 / 1379 » Generation Problems |
179
click to vote
ML
2002
ACM
15 years 5 months ago
2002
ACM
We examine linear program (LP) approaches to boosting and demonstrate their efficient solution using LPBoost, a column generation based simplex method. We formulate the problem as...
154
click to vote
LATIN
2004
Springer
15 years 11 months ago
2004
Springer
Given a finite set V , and integers k ≥ 1 and r ≥ 0, denote by A(k, r) the class of hypergraphs A ⊆ 2V with (k, r)-bounded intersections, i.e. in which the intersection of a...
129
click to vote
ICALT
2008
IEEE
16 years 19 days ago
2008
IEEE
The goal of this work is the design and construction of adaptive tutorials based on the application of algorithms for the automatic resolution of problems which can be used to aut...
137
click to vote
EMNLP
2006
15 years 7 months ago
2006
In this paper we describe and evaluate several statistical models for the task of realization ranking, i.e. the problem of discriminating between competing surface realizations ge...
142
click to vote
COR
2008
15 years 6 months ago
2008
In this paper, an improved Two-Stage Simulated Annealing algorithm is presented for the Minimum Linear Arrangement Problem for Graphs. This algorithm integrates several distinguis...