Sciweavers

341 search results - page 1 / 69
» Redundancy elimination revisited
Sort
View
IEEEPACT
2008
IEEE
13 years 10 months ago
Redundancy elimination revisited
This work proposes and evaluates improvements to previously known algorithms for redundancy elimination. Enhanced Scalar Replacement combines two classic techniques, scalar replac...
Keith D. Cooper, Jason Eckhardt, Ken Kennedy
ICTAI
2003
IEEE
13 years 9 months ago
Eliminating Redundancies in SAT Search Trees
Conflict analysis is a powerful paradigm of backtrack search algorithms, in particular for solving satisfiability problems arising from practical applications. Accordingly, most...
Richard Ostrowski, Bertrand Mazure, Lakhdar Sais, ...
AMW
2010
13 years 5 months ago
Minimising RDF Graphs under Rules and Constraints Revisited
Based on practical observations on rule-based inference on RDF data, we study the problem of redundancy elimination in RDF in the presence of rules (in the form of Datalog rules) a...
Reinhard Pichler, Axel Polleres, Sebastian Skritek...
CORR
2011
Springer
144views Education» more  CORR 2011»
12 years 11 months ago
Schema Redescription in Cellular Automata: Revisiting Emergence in Complex Systems
—We present a method to eliminate redundancy in the transition tables of Boolean automata: schema redescription with two symbols. One symbol is used to capture redundancy of indi...
Manuel Marques-Pita, Luis Mateus Rocha
ARITH
2003
IEEE
13 years 9 months ago
Revisiting SRT Quotient Digit Selection
The quotient digit selection in the SRT division algorithm is based on a few most significant bits of the remainder and divisor, where the remainder is usually represented in a r...
Peter Kornerup