Optimization of a Data Dependence Graph for the Local Microcode Compaction Problem. Part 2: Algorithms and Experimental Verification

Author： Malykh O. N. Shakhnovskii Yu. S.

Publisher： MAIK Nauka/Interperiodica

ISSN： 0361-7688

Source： Programming and Computer Software, Vol.30, Iss.3, 2004-05, pp. : 134-141

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

Algorithms for some graph theoretical optimization problems

By Moonen Linda

4OR: Quarterly journal of the Belgian, French and Italian operations research societies, Vol. 4, Iss. 3, 2006-09 ,pp. : 259-261

Springer Publishing Company

Access to resources Recommend Favorite

A comparison of various optimization algorithms on a multilevel problem

By El-Beltagy M.A. Keane A.J.

Engineering Applications of Artificial Intelligence, Vol. 12, Iss. 5, 1999-10 ,pp. : 639-654

Elsevier

Access to resources Recommend Favorite

Parallel algorithms for a multi-level network optimization problem

By Mateus† G.R.

Parallel Algorithms and Applications, Vol. 18, Iss. 3, 2003-09 ,pp. : 121-137

Taylor & Francis Ltd

Access to resources Recommend Favorite

A Range-Compaction Heuristic for Graph Coloring

By Di Blas Andrea Jagota Arun Hughey Richard

Journal of Heuristics, Vol. 9, Iss. 6, 2003-12 ,pp. : 489-506

Springer Publishing Company

Access to resources Recommend Favorite

Local Search Genetic Algorithms for the Job Shop Scheduling Problem

Applied Intelligence, Vol. 21, Iss. 1, 2004-07 ,pp. : 99-109

Springer Publishing Company

Access to resources Recommend Favorite