More Efficient Parallel Totally Monotone Matrix Searching

Author： Bradford P.G.   Fleischer R.   Smid M.  

Publisher： Academic Press

ISSN： 0196-6774

Source： Journal of Algorithms, Vol.23, Iss.2, 1997-05, pp. : 386-400

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

Efficient Recognition of Totally Nonnegative Matrix Cells

By Launois S.   Lenagan T.  

Foundations of Computational Mathematics, Vol. 14, Iss. 2, 2014-04 ,pp. : 371-387

Springer Publishing Company

Access to resources Recommend Favorite

On sequential and parallel non-monotone derivative-free algorithms for box constrained optimization

By García-Palomares Ubaldo M.   García-Urrea Ildemaro J.   Rodríguez-Hernández Pedro S.  

Optimization Methods and Software, Vol. 28, Iss. 6, 2013-12 ,pp. : 1233-1261

Taylor & Francis Ltd

Access to resources Recommend Favorite

Convergence of the power sequence of a nearly monotone increasing fuzzy matrix

By Zhou T.F.   Liu D.-F.  

Fuzzy Sets and Systems, Vol. 88, Iss. 3, 1997-06 ,pp. : 363-372

Elsevier

Access to resources Recommend Favorite

Pharmaceutical systems made more efficient

By  

World Pumps, Vol. 1997, Iss. 366, 1997-03 ,pp. : 18-19

Elsevier

Access to resources Recommend Favorite

Efficient algorithms for the matrix cosine and sine

By Hargreaves Gareth   Higham Nicholas  

Numerical Algorithms, Vol. 40, Iss. 4, 2005-12 ,pp. : 383-400

Springer Publishing Company

Access to resources Recommend Favorite