1179 search results - page 168 / 236 » Relative Timing Based Verification of Timed Circuits and Sys... |
131
click to vote
CAV
2001
Springer
15 years 9 months ago
2001
Springer
Regular languages have proved useful for the symbolic state exploration of infinite state systems. They can be used to represent infinite sets of system configurations; the tran...
142
click to vote
COCO
2010
Springer
15 years 6 months ago
2010
Springer
—A space bounded Stack Machine is a regular Turing Machine with a read-only input tape, several space bounded read-write work tapes, and an unbounded stack. Stack Machines with a...
139
click to vote
ICRA
2002
IEEE
15 years 9 months ago
2002
IEEE
—This article describes a rigorous and complete framework for the simultaneous localization and map building problem for mobile robots: the symmetries and perturbations map (SPma...
153
Voted
DAC
2005
ACM
16 years 5 months ago
2005
ACM
We propose a system architecture for real-time hardware speech recognition on low-cost, power-constrained devices. The system is intended to support real-time speech-based user in...
171
click to vote
FMSD
2007
15 years 4 months ago
2007
Symbolic techniques based on Binary Decision Diagrams (BDDs) are widely employed for reasoning about temporal properties of hardware circuits and synchronous controllers. However, ...