444 search results - page 34 / 89 » Termination by Abstraction |
JSAC
2007
13 years 9 months ago
2007
Abstract— In this paper we study the effects of practical pilotassisted channel state estimation on the achievable information theoretic data rates (uplink and downlink) in a mul...
CORR
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. This paper presents two new approaches to prove termination of rewrite systems with the Knuth-Bendix order efficiently. The constraints for the weight function and for th...
CORR
2007
Springer
13 years 9 months ago
2007
Springer
Abstract— We analyze fading relay networks, where a singleantenna source-destination terminal pair communicates through a set of half-duplex single-antenna relays using a two-hop...
CAV
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. We present an extrapolation with care set operator to accelerate termination of reachability computation with polyhedra. At the same time, a counterexample guided refine...
SOFSEM
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. The dependency pair method is a powerful method for automatically proving termination of rewrite systems. When used with traditional simplification orders like LPO and K...