204 search results - page 22 / 41 » Parameterizations of Test Cover with Bounded Test Sizes |
CORR
2010
Springer
14 years 10 months ago
2010
Springer
In their paper on the "chasm at depth four", Agrawal and Vinay have shown that polynomials in m variables of degree O(m) which admit arithmetic circuits of size 2o(m) al...
ICSM
2002
IEEE
15 years 3 months ago
2002
IEEE
The Object Relation Diagram (ORD) of a program is a class interdependence diagram which has applications in a wide variety of software engineering problems (e.g., integration test...
FOCS
2009
IEEE
15 years 5 months ago
2009
IEEE
Polynomial time preprocessing to reduce instance size is one of the most commonly deployed heuristics to tackle computationally hard problems. In a parameterized problem, every in...
TEC
2012
13 years 27 days ago
2012
Recently, the generalization framework in co-evolutionary learning has been theoretically formulated and demonstrated in the context of game-playing. Generalization performance of...
CONCUR
2000
Springer
15 years 2 months ago
2000
Springer
We introduce some new models of infinite-state transition systems. The basic model, called a (reversal-bounded) counter machine (CM), is a nondeterministic finite automaton augment...