Sciweavers

7311 search results - page 345 / 1463
» Time in State Machines
Sort
View
IRREGULAR
1995
Springer
15 years 11 months ago
Run-Time Techniques for Parallelizing Sparse Matrix Problems
Sparse matrix problems are di cult to parallelize e ciently on message-passing machines, since they access data through multiple levels of indirection. Inspector executor strategie...
Manuel Ujaldon, Shamik D. Sharma, Joel H. Saltz, E...
SODA
2001
ACM
147views Algorithms» more  SODA 2001»
15 years 9 months ago
Sublinear time approximate clustering
Clustering is of central importance in a number of disciplines including Machine Learning, Statistics, and Data Mining. This paper has two foci: 1 It describes how existing algori...
Nina Mishra, Daniel Oblinger, Leonard Pitt
FORMATS
2007
Springer
16 years 1 months ago
Undecidability of Universality for Timed Automata with Minimal Resources
Timed automata were introduced by Alur and Dill in the early 1990s and have since become the most prominent modelling formalism for real-time systems. A fundamental limit to the al...
Sara Adams, Joël Ouaknine, James Worrell
ARCS
2006
Springer
15 years 11 months ago
Microcode with Embedded Timing Constraints
: Watchdogs are a well-known and widespread means to increase the safety of microprocessors. The programmer or the compiler must insert instructions to reset the watchdog. If the p...
Bernhard Fechner
ICCAD
2003
IEEE
115views Hardware» more  ICCAD 2003»
16 years 4 months ago
Efficient Verification of Hazard-Freedom in Gate-Level Timed Asynchronous Circuits
This paper presents an efficient method for verifying hazard freedom in timed asynchronous circuits. Timed circuits are a class of asynchronous circuits that utilize explicit tim...
Curtis A. Nelson, Chris J. Myers, Tomohiro Yoneda