204 search results - page 22 / 41 » Parameterizations of Test Cover with Bounded Test Sizes |
139
click to vote
CORR
2010
Springer
15 years 4 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...
121
click to vote
ICSM
2002
IEEE
15 years 9 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...
136
click to vote
FOCS
2009
IEEE
15 years 11 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...
149
click to vote
TEC
2012
13 years 6 months 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...
138
click to vote
CONCUR
2000
Springer
15 years 8 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...