Sciweavers

2006 search results - page 114 / 402
» Heuristic Security-Testing Methods
Sort
View
COR
2010
108views more  COR 2010»
15 years 24 days ago
GRASP and path relinking for the max-min diversity problem
The Max-Min Diversity Problem (MMDP) consists in selecting a subset of elements from a given set in such a way that the diversity among the selected elements is maximized. The prob...
Mauricio G. C. Resende, Rafael Martí, Micae...
COR
2004
146views more  COR 2004»
15 years 16 days ago
An exact algorithm for the robust shortest path problem with interval data
The robust deviation shortest path problem with interval data is studied in this paper. After the formulation of the problem in mathematical terms, an exact algorithm, based on a ...
Roberto Montemanni, Luca Maria Gambardella
86
Voted
ACL
2009
14 years 10 months ago
Optimizing Word Alignment Combination For Phrase Table Training
Combining word alignments trained in two translation directions has mostly relied on heuristics that are not directly motivated by intended applications. We propose a novel method...
Yonggang Deng, Bowen Zhou
120
Voted
ML
2007
ACM
156views Machine Learning» more  ML 2007»
15 years 6 days ago
Active learning for logistic regression: an evaluation
Which active learning methods can we expect to yield good performance in learning binary and multi-category logistic regression classifiers? Addressing this question is a natural ...
Andrew I. Schein, Lyle H. Ungar
70
Voted
ICC
2007
IEEE
151views Communications» more  ICC 2007»
15 years 7 months ago
The Probability of Undetected Error for Varshamov-Tenengol'ts Codes
—Computation of the undetected error probability for error correcting codes over the Z-channel is an important issue, explored only in part in previous literature. In this paper ...
Franco Chiaraluce, Marco Baldi, Susanna Spinsante,...