1486 search results - page 41 / 298 » Algorithms for two-box covering |
100
Voted
AAAI
2008
15 years 3 months ago
2008
The survey propagation (SP) algorithm has been shown to work well on large instances of the random 3-SAT problem near its phase transition. It was shown that SP estimates marginal...
126
Voted
AMAI
2000
Springer
15 years 4 months ago
2000
Springer
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Comp...
176
Voted
SIGMOD
2005
ACM
16 years 28 days ago
2005
ACM
In this paper, we propose a novel algorithm to discover the topk covering rule groups for each row of gene expression profiles. Several experiments on real bioinformatics datasets...
118
click to vote
WG
2007
Springer
15 years 6 months ago
2007
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
WINE
2009
Springer
15 years 7 months ago
2009
Springer
We propose approximation algorithms under game-theoretic considerations. We indroduce and study the general covering problem which is a natural generalization of the well-studied m...