1425 search results - page 99 / 285 » Beyond Dependency Graphs |
113
click to vote
ISSS
1995
IEEE
15 years 6 months ago
1995
IEEE
This paper examines the problem of code-generation for expression trees on non-homogeneous register set architectures. It proposes and proves the optimality of an O(n) algorithm f...
131
Voted
EDBTW
2006
Springer
15 years 4 months ago
2006
Springer
The information infrastructure in today's businesses consists of many interoperating autonomous systems. Changes to a single system can therefore have an unexpected impact on ...
134
Voted
EPEW
2008
Springer
15 years 4 months ago
2008
Springer
Currently compilers contain a large number of optimisations which are based on a set of heuristics that are not guaranteed to be effective to improve the performance metrics. In th...
174
Voted
CSR
2011
Springer
14 years 6 months ago
2011
Springer
The Goldreich’s function has n binary inputs and n binary outputs. Every output depends on d inputs and is computed from them by the fixed predicate of arity d. Every Goldreich...
133
Voted
MOZ
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. Extensible Dependency Grammar (XDG) is a graph description language whose formulas can be solved by constraint programming. XDG is designed so as to yield a declarative a...