16404 search results - page 90 / 3281 » A set coverage problem |
118
click to vote
CC
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. The problem of testing membership in the subset of the natural numbers produced at the output gate of a {∪, ∩,− , +, ×} combinational circuit is shown to capture a...
116
click to vote
COMPGEOM
1997
ACM
15 years 7 months ago
1997
ACM
Given a pair of nonidentical complex objects, de ning and determining how similar they are to each other is a nontrivial problem. In data mining applications, one frequently nee...
ENDM
2008
15 years 3 months ago
2008
In this work we deal with sandwich graphs G = (V, E) and present the notion of vertices f-controlled by a subset M V . We introduce the generalized maxcontrolled set problem (gmc...
108
click to vote
ESA
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. We evaluate the performance of FPT algorithms for the directed feedback vertex set problem (DFVS). We propose several new data reduction rules for DFVS. which can signiï¬...
150
click to vote
NOMS
2006
IEEE
15 years 9 months ago
2006
IEEE
— Open Shortest Path First (OSPF) is a routing protocol which is widely used in the Industry. Its functionality mainly depends on the weights assigned to the links. Given the tra...