Sciweavers

12257 search results - page 27 / 2452
» Analysis of Algorithms
Sort
View
CSC
2009
13 years 9 months ago
An Empirical Analysis of Approximation Algorithms for Euclidean TSP
- The Traveling Salesman Problem (TSP) is perhaps the most famous optimization problem in the set NP-hard. Many problems that are natural applications in computer science and engin...
Bárbara Rodeker, M. Virginia Cifuentes, Lil...
CEC
2007
IEEE
14 years 2 months ago
On the analysis of average time complexity of estimation of distribution algorithms
— Estimation of Distribution Algorithm (EDA) is a well-known stochastic optimization technique. The average time complexity is a crucial criterion that measures the performance o...
Tianshi Chen, Ke Tang, Guoliang Chen, Xin Yao
IRI
2007
IEEE
14 years 2 months ago
Comparative Analysis of Different Text Segmentation Algorithms on Arabic News Stories
The task of text segmentation represents an important step in many applications and while much work has been carried out to address this task for the English language, work on tex...
Michael A. El-Shayeb, Samhaa R. El-Beltagy, Ahmed ...
JSA
2006
82views more  JSA 2006»
13 years 7 months ago
A flocking based algorithm for document clustering analysis
ct 7 Social animals or insects in nature often exhibit a form of emergent collective behavior known as flocking. In this paper, 8 we present a novel Flocking based approach for doc...
Xiaohui Cui, Jinzhu Gao, Thomas E. Potok
ICML
2009
IEEE
14 years 8 months ago
Generalization analysis of listwise learning-to-rank algorithms
This paper presents a theoretical framework for ranking, and demonstrates how to perform generalization analysis of listwise ranking algorithms using the framework. Many learning-...
Yanyan Lan, Tie-Yan Liu, Zhiming Ma, Hang Li