Algorithms for enumeration of single-transition serial sequences

Author： Amelkin V.  

Publisher： MAIK Nauka/Interperiodica

ISSN： 1995-4239

Source： Numerical Analysis and Applications, Vol.3, Iss.4, 2010-10, pp. : 295-305

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

Periodic complementary binary sequences and Combinatorial Optimization algorithms

By Kotsireas I.   Koukouvinos C.   Pardalos P.   Shylo O.  

Journal of Combinatorial Optimization, Vol. 20, Iss. 1, 2010-07 ,pp. : 63-75

Springer Publishing Company

Access to resources Recommend Favorite

ALGORITHMS FOR COMPUTING APPROXIMATE REPETITIONS IN MUSICAL SEQUENCES

By CAMBOUROPOULOS EMILIOS  

International Journal of Computer Mathematics, Vol. 79, Iss. 11, 2002-01 ,pp. : 1135-1148

Taylor & Francis Ltd

Access to resources Recommend Favorite

Timing problems and algorithms: Time decisions for sequences of activities

By  

NETWORKS: AN INTERNATIONAL JOURNAL, Vol. 65, Iss. 2, 2015-03 ,pp. : 102-128

John Wiley & Sons Inc

Access to resources Recommend Favorite

Transition Functions for Evolutionary Algorithms on Continuous State-space

By Agapie Alexandru   Agapie Mircea  

Journal of Mathematical Modelling and Algorithms, Vol. 6, Iss. 2, 2007-06 ,pp. : 297-315

Springer Publishing Company

Access to resources Recommend Favorite

Generation and correlation algorithms for ternary complementary pairs of sequences of length 3·2n

By  

INTERNATIONAL JOURNAL OF CIRCUIT THEORY AND APPLICATIONS, Vol. 43, Iss. 9, 2015-09 ,pp. : 1235-1242

John Wiley & Sons Inc

Access to resources Recommend Favorite