534 search results - page 72 / 107 » Proving Termination of Rewrite Systems Using Bounds |
113
click to vote
CORR
2007
Springer
15 years 1 months ago
2007
Springer
Abstract— Infrastructure based wireless communications systems as well as ad hoc networks experience a growing importance in present-day telecommunications. An increased density ...
244
click to vote
ICDE
2009
IEEE
16 years 3 months ago
2009
IEEE
Abstract-- When dealing with massive quantities of data, topk queries are a powerful technique for returning only the k most relevant tuples for inspection, based on a scoring func...
CORR
2008
Springer
15 years 2 months ago
2008
Springer
For general memoryless systems, the typical information theoretic solution - when exists - has a "single-letter" form. This reflects the fact that optimum performance ca...
77
Voted
INFSOF
2006
15 years 1 months ago
2006
Program slicing identifies parts of a program that potentially affect a chosen computation. It has many applications in software engineering, including maintenance, evolution and ...
124
click to vote
CSL
2000
Springer
15 years 6 months ago
2000
Springer
This paper introduces a typed λ-calculus called λPower , a predicative reformulation of part of Cardelli’s power type system. Power types integrate subtyping into the typing t...