Results 291 to 300 of about 7,804,605 (312)

Coding Ants: Optimization of GPU code using ant colony optimization

Computer Languages, Systems & Structures, 2018
Abstract This article proposes the Coding Ants framework, an approach for auto-tuning which uses ant colony optimization to find a sequence of code optimizations for GPU architectures. The proposed framework is built as an extension to the PPCG compiler, a source-to-source code generator based on the polyhedral model and specializing in the ...
Eric Papenhausen, Klaus Mueller 0001
openaire   +1 more source

Symbolic Debugging of Optimized Code

ACM Transactions on Programming Languages and Systems, 1982
The long standing conflict between the optimization of code and the ability to symbolically debug the code is examined. The effects of local and global optimizations on the variables of a program are categorized and models for representing the effect of optimizations are given. These models are used by algorithms which determine the subset of variables
openaire   +2 more sources

Code optimization for code compression

International Symposium on Code Generation and Optimization, 2003. CGO 2003., 2003
Milenko Drinic, Darko Kirovski, Hoi Vo
openaire   +1 more source

Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)

IEEE Transactions on Information Theory, 1974
L. Bahl, J. Cocke, F. Jelinek, J. Raviv
semanticscholar   +1 more source

F-Code: An Optimized MDS Array Code

2007
Based on the research of MDS array code of size n×n in distributed storage system, in this paper, we present a novel encoding scheme called the F-code and prove that the column distance of the F-code is 3, i.e. F-code is a MDS array code given that odd number n is greater than 3 and does not include factor 3.
Jianbo Fan, Lidan Shou, Jinxiang Dong
openaire   +1 more source

On the competitive optimality of Huffman codes

IEEE Transactions on Information Theory, 1991
Let X be a discrete random variable drawn according to a probability mass function p(x), and suppose p(x), is dyadic, i.e., log(1/p(x)) is an integer for each x. It is shown that the binary code length assignment l(x)=log(1/p(x)) dominates any other uniquely decodable assignment l'(x) in expected length in the sense that El(X) Pr(l (X)>l'(X)), which ...
openaire   +1 more source

Probability of error for optimal codes in a Gaussian channel

, 1959
C. Shannon
semanticscholar   +1 more source

Scalable Intra Coding Optimization for Video Coding

IEEE Transactions on Circuits and Systems for Video Technology, 2022
Jiaqi Zhang, Meng Wang, Chuanmin Jia, Shanshe Wang, Siwei Ma, Wen Gao   +5 more
openaire   +1 more source

Is ASCII Code An Optimal Code?

Proceedings of the 6th International Conference on Optimization of Electrical and Electronic Equipments, 2005
S. Tabirca, T. Tabirca, E. Ciurea
openaire   +1 more source

Code Optimization

2020
Nasser Kehtarnavaz, Abhishek Sehgal, Shane Parris, Arian Azarang   +3 more
openaire   +1 more source