On selection of nonmultiplicative prolongations in computation of Janet bases

ISSN： 0361-7688

Source： Programming and Computer Software, Vol.33, Iss.3, 2007-05, pp. : 147-153

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

Effectiveness of involutive criteria in computation of polynomial Janet bases

By Gerdt V. Yanovich D.

Programming and Computer Software, Vol. 32, Iss. 3, 2006-05 ,pp. : 134-138

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Parallel computation of Janet and Gröbner bases over rational numbers

By Gerdt V. Yanovich D.

Programming and Computer Software, Vol. 31, Iss. 2, 2005-03 ,pp. : 73-80

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Computation of minimal event bases that ensure diagnosability

By Basilio João

Discrete Event Dynamic Systems, Vol. 22, Iss. 3, 2012-09 ,pp. : 249-292

Springer Publishing Company

Access to resources Recommend Favorite

RATIONAL MODEL SELECTION IN LARGE ENGINEERING KNOWLEDGE BASES

By Toppano Elio

Applied Artificial Intelligence, Vol. 10, Iss. 3, 1996-06 ,pp. : 191-224

Taylor & Francis Ltd

Access to resources Recommend Favorite

Evolutionary computation for feature selection in classification problems

WILEY INTERDISCIPLINARY REVIEWS: DATA MINING AND KNOWLEDGE DISCOVERY (ELECTRONIC), Vol. 3, Iss. 6, 2013-11 ,pp. : 381-407

John Wiley & Sons Inc

Access to resources Recommend Favorite