113 search results - page 16 / 23 » Reduction Strategies for Left-Linear Term Rewriting Systems |
122
Voted
IJSI
2008
15 years 11 days ago
2008
In [19], Toyama proved that the union of two confluent term-rewriting systems that share absolutely no function symbols or constants is likewise confluent, a property called modula...
122
Voted
XPU
2004
Springer
15 years 5 months ago
2004
Springer
We describe how a small, successful, self-selected XP team approached a seemingly intractable problem with panache, flair and immodesty. We rewrote a legacy application by deliver...
114
click to vote
RTA
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. In this paper we present our formalization of two important termination techniques for term rewrite systems: the subterm criterion and the reduction pair processor in com...
106
click to vote
IWCMC
2009
ACM
15 years 6 months ago
2009
ACM
In wireless communication systems, adaptive modulation and coding (AMC) is used to improve the downlink (DL) spectral efficiency by exploiting the underlying channel condition. Ho...
108
click to vote
DAC
2002
ACM
16 years 1 months ago
2002
ACM
In this paper, we present a compiler strategy to optimize data accesses in regular array-intensive applications running on embedded multiprocessor environments. Specifically, we p...