Code size reduction by compressing repeated instruction sequences

ISSN： 0920-8542

Source： The Journal of Supercomputing, Vol.40, Iss.3, 2007-06, pp. : 319-331

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A class of injective compressing maps on linear recurring sequences over a Galois ring

By Bylkov D.

Problems of Information Transmission, Vol. 46, Iss. 3, 2010-09 ,pp. : 245-252

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

The repeated nondestructive march tests with variable address sequences

By Yarmolik V. Yarmolik S.

Automation and Remote Control, Vol. 68, Iss. 4, 2007-04 ,pp. : 688-698

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Code Transformations for TLB Power Reduction

By Jeyapaul Reiley Shrivastava Aviral

International Journal of Parallel Programming, Vol. 38, Iss. 3-4, 2010-06 ,pp. : 254-276

Springer Publishing Company

Access to resources Recommend Favorite

Compressing hexahedral volume meshes

By Isenburg M. Alliez P.

Graphical Models, Vol. 65, Iss. 4, 2003-07 ,pp. : 239-257

Elsevier

Access to resources Recommend Favorite

Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard

By Charon I. Hudry O. Lobstein A.

Theoretical Computer Science, Vol. 290, Iss. 3, 2003-01 ,pp. : 2109-2120

Elsevier

Access to resources Recommend Favorite