Sciweavers

1279 search results - page 50 / 256
» Fast Implementations of Automata Computations
Sort
View
COMGEO
2000
ACM
13 years 7 months ago
Fast and accurate collision detection for haptic interaction using a three degree-of-freedom force-feedback device
We present a fast and accurate collision detection algorithm for haptic interaction with polygonal models. Given a model, we pre-compute a hybrid hierarchical representation, cons...
Arthur D. Gregory, Ming C. Lin, Stefan Gottschalk,...
DAC
1996
ACM
13 years 11 months ago
A Parallel Precorrected FFT Based Capacitance Extraction Program for Signal Integrity Analysis
In order to optimize interconnect to avoid signal integrity problems, very fast and accurate 3-D capacitance extraction is essential. Fast algorithms, such as the multipole or prec...
Narayan R. Aluru, V. B. Nadkarni, James White
TACAS
1999
Springer
91views Algorithms» more  TACAS 1999»
13 years 12 months ago
Timed Diagnostics for Reachability Properties
We consider the problem of computing concrete diagnostics for timed automata and reachability properties. Concrete means containing information both about the discrete state change...
Stavros Tripakis
CAV
2003
Springer
140views Hardware» more  CAV 2003»
13 years 11 months ago
Rabbit: A Tool for BDD-Based Verification of Real-Time Systems
Thispapergivesashort overviewofa model checking tool forreal-time systems. The modeling language are timed automata extended with concepts for modular modeling. The tool provides r...
Dirk Beyer, Claus Lewerentz, Andreas Noack
ERSHOV
2003
Springer
14 years 26 days ago
A Polymorphic Radix- n Framework for Fast Fourier Transforms
We provide a polymorphic framework for radix-n Fast Fourier Transforms (FFTs) where all known kinds of monomoporhic radix-n algorithms can be obtained by specialization. The framew...
Marcin Zalewski, Sibylle Schupp