Related content

Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems

By Blum A.   Konjevod G.   Ravi R.   Vempala S.  

Theoretical Computer Science, Vol. 235, Iss. 1, 2000-03 ,pp. : 25-42

Elsevier

Access to resources Recommend Favorite

A New Quadratic Semi-infinite Programming Algorithm Based on Dual Parametrization

By Liu Y.   Teo K.L.   Wu S.Y.  

Journal of Global Optimization, Vol. 29, Iss. 4, 2004-08 ,pp. : 401-413

Springer Publishing Company

Access to resources Recommend Favorite

Parallel algorithm for solving linear programming problem under conditions of incomplete data

By Sokolinskaya I.   Sokolinskii L.  

Automation and Remote Control, Vol. 71, Iss. 7, 2010-07 ,pp. : 1452-1460

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Parallel Programming and Its Architectures Based on Data Access Separated Algorithm Kernels

By  

International Journal of Embedded and Real-Time Communication Systems (IJERTCS), Vol. 1, Iss. 1, 2010-01 ,pp. : 64-85

IGI Global_journal

Access to resources Recommend Favorite

Contracting Optimally an Interval Matrix without Loosing Any Positive Semi-Definite Matrix Is a Tractable Problem

By Jaulin Luc   Henrion Didier  

Reliable Computing, Vol. 11, Iss. 1, 2005-02 ,pp. : 1-17

Springer Publishing Company

Access to resources Recommend Favorite