Sciweavers

531 search results - page 78 / 107
» A Better Algorithm for Random k-SAT
Sort
View
COCO
1998
Springer
123views Algorithms» more  COCO 1998»
14 years 1 months ago
Isolation, Matching, and Counting
We show that the perfect matching problem is in the complexity class SPL in the nonuniform setting. This provides a better upper bound on the complexity of the matching problem, a...
Eric Allender, Klaus Reinhardt
ESOA
2006
14 years 22 days ago
Greedy Cheating Liars and the Fools Who Believe Them
Evolutionary algorithms based on "tags" can be adapted to induce cooperation in selfish environments such as peer-to-peer systems. In this approach, nodes periodically co...
Stefano Arteconi, David Hales, Özalp Babaoglu
HIS
2004
13 years 10 months ago
K-Ranked Covariance Based Missing Values Estimation for Microarray Data Classification
Microarray data often contains multiple missing genetic expression values that degrade the performance of statistical and machine learning algorithms. This paper presents a K rank...
Muhammad Shoaib B. Sehgal, Iqbal Gondal, Laurence ...
ICWN
2004
13 years 10 months ago
Does Cluster Architecture Enhance Performance Scalability of Clustered Mobile Ad Hoc Networks?
This paper explains and evaluates the performance of a cluster architecture-based routing protocol, called Link Cluster Protocol (LCP), in mobile ad hoc networks (MANETs). LCP show...
Myeong L. Lim, Chansu Yu
PR
2008
85views more  PR 2008»
13 years 9 months ago
Quadratic boosting
This paper presents a strategy to improve the AdaBoost algorithm with a quadratic combination of base classifiers. We observe that learning this combination is necessary to get be...
Thang V. Pham, Arnold W. M. Smeulders