Sciweavers

315 search results - page 35 / 63
» Improving Performance by Branch Reordering
Sort
View
MP
2007
97views more  MP 2007»
13 years 8 months ago
On the domino-parity inequalities for the STSP
Abstract One method which has been used very successfully for finding optimal and provably good solutions for large instances of the Symmetric Travelling Salesman Problem (STSP) i...
Sylvia C. Boyd, Sally Cockburn, Danielle Vella
ESANN
2001
13 years 10 months ago
Learning fault-tolerance in Radial Basis Function Networks
This paper describes a method of supervised learning based on forward selection branching. This method improves fault tolerance by means of combining information related to general...
Xavier Parra, Andreu Català
PRL
2010
188views more  PRL 2010»
13 years 3 months ago
A fast divisive clustering algorithm using an improved discrete particle swarm optimizer
As an important technique for data analysis, clustering has been employed in many applications such as image segmentation, document clustering and vector quantization. Divisive cl...
Liang Feng, Ming-Hui Qiu, Yu-Xuan Wang, Qiao-Liang...
EGH
2009
Springer
13 years 6 months ago
Faster incoherent rays: Multi-BVH ray stream tracing
High fidelity rendering via ray tracing requires tracing incoherent rays for global illumination and other secondary effects. Recent research show that the performance benefits fr...
John A. Tsakok
IJCNLP
2005
Springer
14 years 2 months ago
Empirical Study of Utilizing Morph-Syntactic Information in SMT
In this paper, we present an empirical study that utilizes morph-syntactical information to improve translation quality. With three kinds of language pairs matched according to mor...
Young-Sook Hwang, Taro Watanabe, Yutaka Sasaki