534 search results - page 39 / 107 » Proving Termination of Rewrite Systems Using Bounds |
139
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
We consider a multi-cell frequency-selective fading uplink channel (network MIMO) from K singleantenna user terminals (UTs) to B cooperative base stations (BSs) with M antennas ea...
231
click to vote
POPL
2007
ACM
16 years 4 months ago
2007
ACM
In aspect-oriented programming, one can intercept events by writing patterns called pointcuts. The pointcut language of the most popular aspect-oriented programming language, Aspe...
131
click to vote
CALCO
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In this paper we describe a language and method for deriving ontologies and ordering databases. The ontological structures arrived at are distributive lattices with attri...
RTA
2005
Springer
15 years 9 months ago
2005
Springer
A convenient method for defining a quasi-ordering, such as those used for proving termination of rewriting, is to choose the minimum of a set of quasi-orderings satisfying some d...
121
click to vote
POPL
2000
ACM
15 years 8 months ago
2000
ACM
In 1998 Asperti and Mairson proved that the cost of reducing a lambda-term using an optimal lambda-reducer (a la L´evy) cannot be bound by any elementary function in the number o...