Sciweavers

1004 search results - page 34 / 201
» Product representations of polynomials
Sort
View
DATE
2009
IEEE
112views Hardware» more  DATE 2009»
14 years 3 months ago
Algebraic techniques to enhance common sub-expression elimination for polynomial system synthesis
: Common sub-expression elimination (CSE) serves as a useful optimization technique in the synthesis of arithmetic datapaths described at RTL. However, CSE has a limited potential ...
Sivaram Gopalakrishnan, Priyank Kalla
AMAI
2004
Springer
14 years 1 months ago
Production Inference, Nonmonotonicity and Abduction
We introduce a general formalism of production inference relations that posses both a standard monotonic semantics and a natural nonmonotonic semantics. The resulting nonmonotonic...
Alexander Bochman
IOR
2010
100views more  IOR 2010»
13 years 6 months ago
Integrated Production and Outbound Distribution Scheduling: Review and Extensions
In many applications involving make-to-order or time-sensitive (e.g., perishable, seasonal) products, finished orders are often delivered to customers immediately or shortly after...
Zhi-Long Chen
CVPR
2010
IEEE
14 years 4 months ago
Relaxing the 3L algorithm for an accurate implicit polynomial fitting
This paper presents a novel method to increase the accuracy of linear fitting of implicit polynomials. The proposed method is based on the 3L algorithm philosophy. The novelty l...
Mohammad Rouhani and Angel D. Sappa
SAS
2004
Springer
14 years 1 months ago
A Polynomial-Time Algorithm for Global Value Numbering
We describe a polynomial-time algorithm for global value numbering, which is the problem of discovering equivalences among program sub-expressions. We treat all conditionals as non...
Sumit Gulwani, George C. Necula