313 search results - page 10 / 63 » Redundancy Elimination for LF |
ICDT
2012
ACM
12 years 1 months ago
2012
ACM
We introduce a new normal form, called essential tuple normal form (ETNF), for relations in a relational database where the constraints are given by functional dependencies and jo...
IEEEPACT
2006
IEEE
14 years 5 months ago
2006
IEEE
Modern compiler transformations that eliminate redundant computations or reorder instructions, such as partial redundancy elimination and instruction scheduling, are very effectiv...
CL
2000
Springer
14 years 2 months ago
2000
Springer
We use Kleene algebra with tests to verify a wide assortment of common compiler optimizations, including dead code elimination, common subexpression elimination, copy propagation,...
PADO
2001
Springer
14 years 3 months ago
2001
Springer
Abstract. We present a high-level approach to array bound check optimization that is neither hampered by recursive functions, nor disabled by the presence of partially redundant ch...
IJAR
2010
13 years 8 months ago
2010
In the original formulation of influence diagrams (IDs), each model contained exactly one utility node. Tatman and Shachter (1990), introduced the possibility of having super-valu...