7393 search results - page 959 / 1479 » Synthesis-for-testability using transformations |
164
click to vote
IJCIS
2007
15 years 6 months ago
2007
by allowing designers to model their systems at different abstraction levels, providing them omatic model transformations to incrementally refine abstract models into more concrete...
187
click to vote
IJPP
2007
15 years 6 months ago
2007
Computations on two-dimensional arrays such as matrices and images are one of the most fundamental and ubiquitous things in computational science and its vast application areas, bu...
153
click to vote
TCBB
2008
15 years 6 months ago
2008
Abstract-- The Maximum Parsimony problem aims at reconstructing a phylogenetic tree from DNA sequences while minimizing the number of genetic transformations. To solve this NP-comp...
144
click to vote
TCS
2008
15 years 6 months ago
2008
Using the fact that the Parikh matrix mapping is not an injective mapping, the paper investigates some properties of the set of words with the same Parikh matrix; these words are ...
188
click to vote
AUTOMATICA
2005
15 years 6 months ago
2005
Based on a recent duality theory for linear differential inclusions (LDIs), the condition for stability of an LDI in terms of one Lyapunov function can be easily derived from that...