Sciweavers

3600 search results - page 95 / 720
» The settling-time reducibility ordering
Sort
View
ISCA
1992
IEEE
111views Hardware» more  ISCA 1992»
15 years 10 months ago
Lazy Release Consistency for Software Distributed Shared Memory
Relaxed memory consistency models, such as release consistency, were introduced in order to reduce the impact of remote memory access latency in both software and hardware distrib...
Peter J. Keleher, Alan L. Cox, Willy Zwaenepoel
ASPDAC
2007
ACM
89views Hardware» more  ASPDAC 2007»
15 years 10 months ago
Trace Compaction using SAT-based Reachability Analysis
In today's designs, when functional verification fails, engineers perform debugging using the provided error traces. Reducing the length of error traces can help the debugging...
Sean Safarpour, Andreas G. Veneris, Hratch Mangass...
ECML
2004
Springer
15 years 10 months ago
Justification-Based Selection of Training Examples for Case Base Reduction
Maintaining compact and competent case bases has become a main topic of Case Based Reasoning (CBR) research. The main goal is to obtain a compact case base (with a reduced number o...
Santiago Ontañón, Enric Plaza
VLDB
1995
ACM
163views Database» more  VLDB 1995»
15 years 9 months ago
An Efficient Algorithm for Mining Association Rules in Large Databases
Mining for a.ssociation rules between items in a large database of sales transactions has been described as an important database mining problem. In this paper we present an effic...
Ashok Savasere, Edward Omiecinski, Shamkant B. Nav...
IJCAI
2003
15 years 7 months ago
Efficient Symmetry Breaking for Boolean Satisfiability
Identifying and breaking the symmetries of CNF formulae has been shown to lead to significant reductions in search times. In this paper we describe a more systematic and efficient...
Fadi A. Aloul, Karem A. Sakallah, Igor L. Markov