Results 211 to 220 of about 327,732 (266)
Some of the next articles are maybe not open access.
Optimal chaining in expression trees
ACM SIGPLAN Notices, 1986Chaining is the ability to pipeline two or more vector instructions on Cray-1 like machines. We show how to optimally use this feature to compute (vector) expression trees, in the context of automatic code-generation. We present a linear-time scheduling algorithm for finding an optimal order of evaluation for a machine with a bounded number of ...
David Bernstein +2 more
openaire +1 more source
Optimal code generation for expression trees
Proceedings of seventh annual ACM symposium on Theory of computing - STOC '75, 1975This paper discusses algorithms which transform expression trees into code for register machines. A necessary and sufficient condition for optimality of such an algorithm is derived, which applies to a broad class of machines. A dynamic programming algorithm is then presented which produces optimal code for any machine in this class; this algorithm ...
Alfred V. Aho, Stephen C. Johnson
openaire +2 more sources
Optimizing C++ Vector Expressions
IEEE Computer Graphics and Applications, 2000Recently, I've been entertaining myself by studying all the nifty new programming techniques that have been invented since I was in school. I started with C++ and object-oriented programming. I'm now progressing through generic programming, aspect-oriented programming, partial evaluation and generative programming.
openaire +1 more source
Optimization of Boolean Expressions-Historical Developments
IEEE Annals of the History of Computing, 1980Boolean expressions play an essential role in all aspects of computer science. Interest in them is rooted in compiler design. Clearly, every compiler must be designed to evaluate Boolean expressions. It is therefore essential that the compiled code be as efficient as possible.
Jack Minker, Rita G. Minker
openaire +1 more source
The Generation of Optimal Code for Arithmetic Expressions
Journal of the ACM, 1970The problem of evaluating arithmetic expressions on a machine with N ≥ 1 general purpose registers is considered. It is initially assumed that no algebraic laws apply to the operators and operands in the expression. An algorithm for evaluation of expressions under this assumption is proposed, and it is shown to take
Ravi Sethi, Jeffrey D. Ullman
openaire +1 more source
Equivalences and optimizations in an expressive XSLT subset
Acta Informatica, 2006zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alberto Trombetta, Danilo Montesi
openaire +4 more sources
Optimal Planning with Expressive Action Languages as Constraint Optimization
2023We consider the problem of optimal planning in deterministic domains specified with expressive action languages. We show how it is possible to reduce such problem to finding an optimal solution of a constraint optimization problem incorporating a bound n on the maximum length of the plan.
Giunchiglia E., Tacchella A.
openaire +2 more sources
Generating Optimal Plans for Boolean Expressions
2018 IEEE 34th International Conference on Data Engineering (ICDE), 2018We present an algorithm that produces optimal plans to evaluate arbitrary Boolean expressions possibly containing conjunctions and disjunctions. The complexity of our algorithm is O(n3n), where n is the number of simple predicates in the Boolean expression. This complexity is far lower than that of Reinwald and Soland's algorithm (O(22n)).
Kastrati, Fisnik, Moerkotte, Guido
openaire +2 more sources
Optimal reduction of functional expressions
1998The usual implementations of functional programming languages based on a weak evaluation paradigm (no reduction inside a lambda), betray the very spirit, i.e. the higher-order nature, of lambda-calculus.
openaire +2 more sources
Algebraic Optimization of Nested XPath Expressions
22nd International Conference on Data Engineering (ICDE'06), 2006The XPath language incorporates powerful primitives for formulating queries containing nested subexpressions which are existentially or universally quantified. However, even the best published approaches for evaluating XPath have unsatisfactory performance when applied to nested queries.
Matthias Brantner +3 more
openaire +3 more sources