Sciweavers

Share
20 search results - page 1 / 4
» On the efficient reduction of complete EM based parametric m...
Sort
View
DATE
2009
IEEE
108views Hardware» more  DATE 2009»
10 years 6 months ago
On the efficient reduction of complete EM based parametric models
Jorge Fernandez Villena, Gabriela Ciuprina, Daniel...
VLSI
2007
Springer
10 years 5 months ago
Parametric structure-preserving model order reduction
Abstract—Analysis and verification environments for nextgeneration nano-scale RFIC designs must be able to cope with increasing design complexity and to account for new effects,...
Jorge Fernandez Villena, Wil H. A. Schilders, L. M...
AMAST
2008
Springer
10 years 1 months ago
Towards an Efficient Implementation of Tree Automata Completion
Term Rewriting Systems (TRSs) are now commonly used as a modeling language for applications. In those rewriting based models, reachability analysis, i.e. proving or disproving that...
Emilie Balland, Yohan Boichut, Thomas Genet, Pierr...
KBSE
2009
IEEE
10 years 6 months ago
Code Completion from Abbreviated Input
—Abbreviation Completion is a novel technique to improve the efficiency of code-writing by supporting code completion of multiple keywords based on non-predefined abbreviated inp...
Sangmok Han, David R. Wallace, Robert C. Miller
QEST
2010
IEEE
9 years 9 months ago
DTMC Model Checking by SCC Reduction
Discrete-Time Markov Chains (DTMCs) are a widely-used formalism to model probabilistic systems. On the one hand, available tools like PRISM or MRMC offer efficient model checking a...
Erika Ábrahám, Nils Jansen, Ralf Wim...
books