17366 search results - page 352 / 3474 » New Revision Algorithms |
191
click to vote
PKDD
2004
Springer
16 years 3 days ago
2004
Springer
Ideally, a multi-strategy learning algorithm performs better than its component approaches. RISE is a multi-strategy algorithm that combines rule induction and instance-based learn...
191
click to vote
AUSAI
1999
Springer
15 years 11 months ago
1999
Springer
In previous work solutions for the nesting problem are produced using the no fit polygon (NFP), a new evaluation method and three evolutionary algorithms (simulated annealing (SA),...
175
click to vote
ACL
1996
15 years 8 months ago
1996
Many different metrics exist for evaluating parsing results, including Viterbi, Crossing Brackets Rate, Zero Crossing Brackets Rate, and several others. However, most parsing algo...
194
click to vote
MCS
2007
Springer
16 years 27 days ago
2007
Springer
Abstract. Cluster ensembles are deemed to be better than single clustering algorithms for discovering complex or noisy structures in data. Various heuristics for constructing such ...
187
click to vote
ESA
2004
Springer
16 years 4 days ago
2004
Springer
Edge contraction is shown to be a useful mechanism to improve lower bound heuristics for treewidth. A successful lower bound for treewidth is the degeneracy: the maximum over all ...