Sciweavers

341 search results - page 2 / 69
» Redundancy elimination revisited
Sort
View
PLDI
1995
ACM
13 years 8 months ago
Interprocedural Partial Redundancy Elimination and its Application to Distributed Memory Compilation
Partial Redundancy Elimination PRE is a general scheme for suppressing partial redundancies which encompasses traditional optimizations like loop invariant code motion and redun...
Gagan Agrawal, Joel H. Saltz, Raja Das
CAV
2003
Springer
106views Hardware» more  CAV 2003»
13 years 9 months ago
Making Predicate Abstraction Efficient: How to Eliminate Redundant Predicates
redicate Abstraction Efficient: How to eliminate redundant predicates Edmund Clarke
Edmund M. Clarke, Orna Grumberg, Muralidhar Talupu...
EUROPAR
2001
Springer
13 years 9 months ago
Load Redundancy Elimination on Executable Code
Optimizations performed at link time or directly applied to nal program executables have received increased attention in recent years. This paper discuss the discovery and elimina...
Manel Fernández, Roger Espasa, Saumya K. De...
CPAIOR
2007
Springer
13 years 11 months ago
Eliminating Redundant Clauses in SAT Instances
In this paper, we investigate to which extent the elimination of a class of redundant clauses in SAT instances could improve the efficiency of modern satisfiability provers. Sinc...
Olivier Fourdrinoy, Éric Grégoire, B...
DEXA
2004
Springer
153views Database» more  DEXA 2004»
13 years 10 months ago
A New Approach of Eliminating Redundant Association Rules
Two important constraints of association rule mining algorithm are support and confidence. However, such constraints-based algorithms generally produce a large number of redundant ...
Mafruz Zaman Ashrafi, David Taniar, Kate A. Smith