Sciweavers

143 search results - page 10 / 29
» How to rank with few errors
Sort
View
ICPP
2007
IEEE
15 years 6 months ago
Difficulty-aware Hybrid Search in Peer-to-Peer Networks
—By combining an unstructured protocol with a DHT-based global index, hybrid peer-to-peer (P2P) improves search efficiency in terms of query recall and response time. The major c...
Hanhua Chen, Hai Jin, Yunhao Liu, Lionel M. Ni
ECIR
2009
Springer
14 years 9 months ago
Active Learning Strategies for Multi-Label Text Classification
Abstract. Active learning refers to the task of devising a ranking function that, given a classifier trained from relatively few training examples, ranks a set of additional unlabe...
Andrea Esuli, Fabrizio Sebastiani
GEM
2009
14 years 9 months ago
Evidence of Coevolution in Multi-objective Evolutionary Algorithms
- This paper demonstrates that simple yet important characteristics of coevolution can occur in evolutionary algorithms when only a few conditions are met. We find that interaction...
James Whitacre
DAC
2009
ACM
16 years 21 days ago
Debugging strategies for mere mortals
Recent improvements in design verification strive to automate error detection and greatly enhance engineers' ability to detect functional errors. However, the process of diag...
Valeria Bertacco
ANTSW
2008
Springer
15 years 24 days ago
The Architecture of Ant-Based Clustering to Improve Topographic Mapping
Abstract. This paper analyzes the popular ant-based clustering approach of Lumer/Faieta. Analysis of formulae unveils that ant-based clustering is strongly related to Kohonen’s S...
Lutz Herrmann, Alfred Ultsch