Sciweavers

471 search results - page 4 / 95
» Reduced-order observer design using a Lagrangian method
Sort
View
MOC
2010
13 years 2 months ago
Entropy-satisfying relaxation method with large time-steps for Euler IBVPs
This paper could have been given the title: "How to positively and implicitly solve Euler equations using only linear scalar advections." The new relaxation method we pr...
Frédéric Coquel, Quang Long Nguyen, ...
BCSHCI
2008
13 years 9 months ago
An investigation into the use of field methods in the design and evaluation of interactive systems
This paper reports the results of an international web-based survey on the use of field studies in the design and evaluation of interactive systems, which was conducted between De...
Kelly Monahan, Mia Lahteenmaki, Sharon McDonald, G...
PPAM
2007
Springer
14 years 1 months ago
A Block-Based Parallel Adaptive Scheme for Solving the 4D Vlasov Equation
We present a parallel algorithm for solving the 4D Vlasov equation. Our algorithm is designed for distributed memory architectures. It uses an adaptive numerical method which reduc...
Olivier Hoenen, Eric Violard
DAC
1998
ACM
13 years 11 months ago
OCCOM: Efficient Computation of Observability-Based Code Coverage Metrics for Functional Verification
—Functional simulation is still the primary workhorse for verifying the functional correctness of hardware designs. Functional verification is necessarily incomplete because it i...
Farzan Fallah, Srinivas Devadas, Kurt Keutzer
DAC
2006
ACM
14 years 8 months ago
SAT sweeping with local observability don't-cares
SAT sweeping is a method for simplifying an AND/INVERTER graph (AIG) by systematically merging graph vertices from the inputs towards the outputs using a combination of structural...
Qi Zhu, Nathan Kitchen, Andreas Kuehlmann, Alberto...