223 search results - page 7 / 45 » Proving Termination by Bounded Increase |
WFLP
2009
Springer
14 years 5 months ago
2009
Springer
A logic program strongly terminates if it terminates for any selection rule. Clearly, considering a particular selection rule—like Prolog’s leftmost selection rule—allows one...
LPAR
2004
Springer
14 years 4 months ago
2004
Springer
The dependency pair approach is one of the most powerful techniques for automated termination proofs of term rewrite systems. Up to now, it was regarded as one of several possible ...
LATA
2009
Springer
14 years 5 months ago
2009
Springer
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...
VTC
2010
IEEE
13 years 9 months ago
2010
IEEE
—In this paper we present an architectural analysis of a smart DMA (sDMA) controller for protocol stack acceleration in mobile devices supporting 3GPP’s Long Term Evolution (LT...
WWW
2007
ACM
2007
ACM
Robust web page segmentation for mobile terminal using content-distances and page layout information
14 years 11 months ago
The demand of browsing information from general Web pages using a mobile phone is increasing. However, since the majority of Web pages on the Internet are optimized for browsing f...