3758 search results - page 193 / 752 » A Complete Subsumption Algorithm |
130
click to vote
FAW
2009
Springer
15 years 8 months ago
2009
Springer
We give a linear-time algorithm for computing the edge search number of cographs, thereby proving that this problem can be solved in polynomial time on this graph class. With our ...
DAC
2003
ACM
15 years 7 months ago
2003
ACM
Coverage estimation for model checking quantifies the completeness of a set of properties. We present an improved version of the algorithm of Hoskote et al. [7] that applies to a...
120
click to vote
STACS
1991
Springer
15 years 5 months ago
1991
Springer
Several relation-algebraic algorithms for computing the cut completion of a partially ordered set are formally developed and afterwards generalized to the case of concept lattices....
101
click to vote
AOR
2006
15 years 2 months ago
2006
This paper is devoted to basic scheduling problems in which the scheduling cost of a job is not a function of its completion time. Instead, the cost is derived from the integratio...
TC
2008
15 years 2 months ago
2008
Abstract-- A radix-2 digit-recurrence algorithm and architecture for the computation of the cube root are presented in this paper. The original recurrence based on the concept of c...