9842 search results - page 1593 / 1969 » The Complexity of the Matching-Cut Problem |
172
click to vote
CSB
2005
IEEE
16 years 11 days ago
2005
IEEE
In the feature selection of cancer classification problems, many existing methods consider genes individually by choosing the top genes which have the most significant signal-to...
168
click to vote
ASPDAC
2005
ACM
16 years 10 days ago
2005
ACM
Abstract— The success of classical high level synthesis has been limited by the complexity of the applications it can handle, typically not large enough to necessitate the depart...
192
click to vote
COCO
2005
Springer
16 years 9 days ago
2005
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
174
click to vote
GECCO
2005
Springer
16 years 8 days ago
2005
Springer
Based on the Antibody Clonal Selection Theory of immunology, we put forward a novel clonal selection algorithm for multiuser detection in Code-division Multiple-access Systems. By...
177
click to vote
SPAA
2004
ACM
16 years 5 days ago
2004
ACM
This paper introduces a new adaptive method, Channel Queue Routing (CQR), for load-balanced routing on k-ary n-cube interconnection networks. CQR estimates global congestion in th...