A Cost-Optimal Pipeline Algorithm for Permutation Generation in Lexicographic Order

ISSN： 0743-7315

Source： Journal of Parallel and Distributed Computing, Vol.44, Iss.2, 1997-08, pp. : 153-159

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 parallel algorithm for the generation of a permutation and applications

By Alonso L. Schott R.

Theoretical Computer Science, Vol. 159, Iss. 1, 1996-05 ,pp. : 15-28

Elsevier

Access to resources Recommend Favorite

Synthesis and stochastic assessment of cost-optimal schedules

By Mader Angelika Bohnenkamp Henrik Usenko Yaroslav Jansen David Hurink Johann Hermanns Holger

International Journal on Software Tools for Technology Transfer, Vol. 12, Iss. 5, 2010-09 ,pp. : 305-318

Springer Publishing Company

Access to resources Recommend Favorite

A Lexicographic Optimization Algorithm

By Zykina A. V.

Automation and Remote Control, Vol. 65, Iss. 3, 2004-03 ,pp. : 363-368

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

A heuristic search algorithm with lexicographic goals

By Mandow L. Perez de la Cruz J.L.

Engineering Applications of Artificial Intelligence, Vol. 14, Iss. 6, 2001-12 ,pp. : 751-762

Elsevier

Access to resources Recommend Favorite

The first-order theory of lexicographic path orderings is undecidable

By Comon H. Treinen R.

Theoretical Computer Science, Vol. 176, Iss. 1, 1997-04 ,pp. : 67-87

Elsevier

Access to resources Recommend Favorite