1272 search results - page 83 / 255 » The Set Cover with Pairs Problem |
127
click to vote
MFCS
2009
Springer
15 years 5 months ago
2009
Springer
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
116
click to vote
CONCUR
2007
Springer
15 years 4 months ago
2007
Springer
We consider message sequence charts enriched with timing constraints between pairs of events. As in the untimed setting, an infinite family of time-constrained message sequence cha...
100
click to vote
IANDC
2010
14 years 10 months ago
2010
We consider message sequence charts enriched with timing constraints between pairs of events. As in the untimed setting, an infinite family of time-constrained message sequence cha...
110
Voted
ASPDAC
2006
ACM
15 years 6 months ago
2006
ACM
Abstract— Substantial attention is being paid to the fault diagnosis problem in recent test literature. Yet, the compaction of test vectors for fault diagnosis is little explored...
115
click to vote
CIKM
2008
Springer
15 years 2 months ago
2008
Springer
Background: Accurate estimation of statistical significance of a pairwise alignment is an important problem in sequence comparison. Recently, a comparative study of pairwise stati...