On polynomial-time approximation algorithms for the variable length scheduling problem

By Czumaj A.   Gasieniec L.   Gaur D.R.   Krishnamurti R.   Rytter W.   Zito M.  

Theoretical Computer Science, Vol. 302, Iss. 1, 2003-06 ,pp. : 489-495

Elsevier

Access to resources Recommend Favorite

A Polynomial-Time Dependence Test for Determining Integer-Valued Solutions in Multi-Dimensional Arrays Under Variable Bounds

By Chang Weng-Long   Chu Chih-Ping   Wu Jia-Hwa  

The Journal of Supercomputing, Vol. 31, Iss. 2, 2005-02 ,pp. : 111-135

Springer Publishing Company

Access to resources Recommend Favorite

Criteria for Polynomial-Time (Conceptual) Clustering

By Pitt L.  

Machine Learning, Vol. 02, Iss. 4, 1988-04 ,pp. : 371-396

Springer Publishing Company

Access to resources Recommend Favorite

A Polynomial-Time Algorithm for Memory Space Reduction

By Song Yonghong   Wang Cheng   Li Zhiyuan  

International Journal of Parallel Programming, Vol. 33, Iss. 1, 2005-02 ,pp. : 1-33

Springer Publishing Company

Access to resources Recommend Favorite

Polynomial-Time Decomposition Algorithms for Support Vector Machines

By Hush D.  

Machine Learning, Vol. 51, Iss. 1, 2003-04 ,pp. : 51-71

Springer Publishing Company

Access to resources Recommend Favorite