Sciweavers

663 search results - page 20 / 133
» A Parallel Algorithm for Enumerating Combinations
Sort
View
EMNLP
2010
14 years 11 months ago
Combining Unsupervised and Supervised Alignments for MT: An Empirical Study
Word alignment plays a central role in statistical MT (SMT) since almost all SMT systems extract translation rules from word aligned parallel training data. While most SMT systems...
Jinxi Xu, Antti-Veikko I. Rosti
GECCO
2006
Springer
170views Optimization» more  GECCO 2006»
15 years 5 months ago
Combining simplex with niche-based evolutionary computation for job-shop scheduling
We propose a hybrid algorithm (called ALPINE) between Genetic Algorithm and Dantzig's Simplex method to approximate optimal solutions for the Flexible Job-Shop Problem. Local...
Syhlin Kuah, Joc Cing Tay
PRL
2002
91views more  PRL 2002»
15 years 1 months ago
StrCombo: combination of string recognizers
In this paper, we contribute a new paradigm of combining string recognizers and propose generic frameworks for hierarchical and parallel combination of multiple string recognizers...
Xiangyun Ye, Mohamed Cheriet, Ching Y. Suen
HPDC
2007
IEEE
15 years 8 months ago
Ridge: combining reliability and performance in open grid platforms
Large-scale donation-based distributed infrastructures need to cope with the inherent unreliability of participant nodes. A widely-used work scheduling technique in such environme...
Krishnaveni Budati, Jason D. Sonnek, Abhishek Chan...
IPPS
1997
IEEE
15 years 5 months ago
Designing Efficient Distributed Algorithms Using Sampling Techniques
In this paper we show the power of sampling techniques in designing efficient distributed algorithms. In particular, we show that using sampling techniques, on some networks, sele...
Sanguthevar Rajasekaran, David S. L. Wei