1088 search results - page 189 / 218 » A Bayesian Approach to Tackling Hard Computational Problems |
103
click to vote
MOBIHOC
2005
ACM
15 years 9 months ago
2005
ACM
The throughput of wireless networks can be significantly improved by multi-channel communications compared with single-channel communications since the use of multiple channels ca...
ATAL
2009
Springer
15 years 4 months ago
2009
Springer
Distributed Lagrangian Relaxation Protocol (DisLRP) has been proposed to solve a distributed combinatorial maximization problem called the Generalized Mutual Assignment Problem (G...
112
click to vote
SIGMOD
2011
ACM
14 years 10 days ago
2011
ACM
Projective Clustering Ensembles (PCE) are a very recent advance in data clustering research which combines the two powerful tools of clustering ensembles and projective clustering...
84
Voted
GECCO
2007
Springer
15 years 1 months ago
2007
Springer
Identification of Transcription Factor Binding Site (TFBS) motifs in multiple DNA upstream sequences is important in understanding the mechanism of gene regulation. This identific...
77
Voted
AAAI
2006
14 years 11 months ago
2006
Model counting is the classical problem of computing the number of solutions of a given propositional formula. It vastly generalizes the NP-complete problem of propositional satis...