13603 search results - page 161 / 2721 » On the Computational Complexity of Cut-Reduction |
148
click to vote
TWC
2010
15 years 28 days ago
2010
In this paper, a reduced-complexity partial transmit sequences (PTS) scheme is proposed to resolve the intrinsic high peak-to-average power ratio (PAPR) problem of orthogonal frequ...
279
click to vote
NFM
2011
15 years 21 days ago
2011
Symbolic execution is a powerful automated technique for generating test cases. Its goal is to achieve high coverage of software. One major obstacle in adopting the technique in pr...
175
click to vote
DLOG
2011
14 years 9 months ago
2011
In order to meet usability requirements, most logic-based applications provide explanation facilities for reasoning services. This holds also for DLs, where research focused on the...
142
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Let S = s1, s2, s3, ..., sn be a given vector of n distinct real numbers. The rank of z R with respect to S is defined as the number of elements si S such that si z. We consider...
159
Voted
ISLPED
1998
ACM
15 years 10 months ago
1998
ACM
Register files (RF) represent a substantial portion of the energy budget in modern processors, and are growing rapidly with the trend towards wider instruction issue. The actual ...