828 search results - page 60 / 166 » Bounded Hairpin Completion |
COMPSAC
2003
IEEE
14 years 3 months ago
2003
IEEE
Complete interaction testing of components is too costly in all but the smallest systems. Yet component interactions are likely to cause unexpected faults. Recently, design of exp...
ILP
2003
Springer
14 years 3 months ago
2003
Springer
We study several complexity parameters for first order formulas and their suitability for first order learning models. We show that the standard notion of size is not captured by...
STACS
2001
Springer
14 years 2 months ago
2001
Springer
Coalgebras for a functor on the category of sets subsume many formulations of the notion of transition system, including labelled transition systems, Kripke models, Kripke frames a...
DAM
2010
13 years 10 months ago
2010
We consider the process of cleaning a network where at each time step, all vertices that have at least as many brushes as incident, contaminated edges, send brushes down these edg...
DM
2008
13 years 10 months ago
2008
Let G be a minimally k-connected graph with n nodes and m edges. Mader proved that if n 3k - 2 then m k(n - k), and for n 3k - 1 an equality is possible if, and only if, G is t...