2313 search results - page 96 / 463 » On Heuristic Time Hierarchies |
149
click to vote
DAC
1997
ACM
15 years 10 months ago
1997
ACM
Binary Decision Diagrams BDDs are e cient at manipulating large sets in a compact manner. BDDs, however, are inefcient at utilizing the memory hierarchy of the computer. Recent ...
171
click to vote
KDD
1995
ACM
15 years 10 months ago
1995
ACM
Data mining or knowledge discovery in databasesis the search for relationships and global patterns that exist but are hidden in large databases.Many different methodshave been pro...
141
click to vote
CHARME
2005
Springer
15 years 12 months ago
2005
Springer
Timing diagrams are useful for capturing temporal specifications in which all mentioned events are required to occur. We first show that translating timing diagrams with both par...
163
click to vote
CASES
2008
ACM
15 years 8 months ago
2008
ACM
In a hard real-time embedded system, the time at which a result is computed is as important as the result itself. Modern processors go to extreme lengths to ensure their function ...
178
click to vote
LCTRTS
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. Previously published methods for estimation of the worstcase execution time on contemporary processors with complex pipelines and multi-level memory hierarchies result in...