Sciweavers

3221 search results - page 33 / 645
» Termination of Linear Programs
Sort
View
CORR
2008
Springer
120views Education» more  CORR 2008»
13 years 8 months ago
Codeword-Independent Performance of Nonbinary Linear Codes Under Linear-Programming and Sum-Product Decoding
A coded modulation system is considered in which nonbinary coded symbols are mapped directly to nonbinary modulation signals. It is proved that if the modulator-channel combination...
Mark F. Flanagan
IFIP
2004
Springer
14 years 1 months ago
Multicode Multirate Compact Assignment of OVSF Codes for QoS Differentiated Terminals
—Orthogonal variable spreading factor (OVSF) codes are used in both universal terrestrial radio access–frequency division duplex (UTRA-FDD) and time division duplex (UTRA-TDD) ...
Yang Yang, Tak-Shing Peter Yum
ENTCS
2007
123views more  ENTCS 2007»
13 years 7 months ago
Proving Termination of Context-Sensitive Rewriting with MU-TERM
Context-sensitive rewriting (CSR) is a restriction of rewriting which forbids reductions on selected arguments of functions. Proving termination of CSR is an interesting problem w...
Beatriz Alarcón, Raúl Gutiérr...
LOPSTR
1998
Springer
14 years 1 days ago
Improving Homeomorphic Embedding for Online Termination
Well-quasi orders in general, and homeomorphic embedding in particular, have gained popularity to ensure online termination of program analysis, specialisation and transformation t...
Michael Leuschel