Sciweavers

725 search results - page 48 / 145
» Smoothed Analysis of Algorithms and Heuristics
Sort
View
SPIRE
2010
Springer
14 years 8 months ago
Why Large Closest String Instances Are Easy to Solve in Practice
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
Christina Boucher, Kathleen Wilkie
ICML
2003
IEEE
15 years 10 months ago
An Analysis of Rule Evaluation Metrics
In this paper we analyze the most popular evaluation metrics for separate-and-conquer rule learning algorithms. Our results show that all commonly used heuristics, including accur...
Johannes Fürnkranz, Peter A. Flach
ACTA
2006
70views more  ACTA 2006»
14 years 10 months ago
Throughput analysis in wireless networks with multiple users and multiple channels
Abstract We consider the problem of maximizing throughput in a multi-carrier wireless network that employs predictive link adaptation. We explicitly consider the time-penalty incur...
Amrinder Arora, Fanchun Jin, Gokhan Sahin, Hosam M...
GECCO
2008
Springer
172views Optimization» more  GECCO 2008»
14 years 11 months ago
Empirical analysis of a genetic algorithm-based stress test technique
Evolutionary testing denotes the use of evolutionary algorithms, e.g., Genetic Algorithms (GAs), to support various test automation tasks. Since evolutionary algorithms are heuris...
Vahid Garousi
COLING
2010
14 years 5 months ago
Build Chinese Emotion Lexicons Using A Graph-based Algorithm and Multiple Resources
For sentiment analysis, lexicons play an important role in many related tasks. In this paper, aiming to build Chinese emotion lexicons for public use, we adopted a graph-based alg...
Ge Xu, Xinfan Meng, Houfeng Wang