Graph model for optimal OVSF code placement strategies

Author： Ouyang Wen   Yu Chang Wu   Liu Meng-Ti   Chang Yu-Wei  

Publisher： Inderscience Publishers

ISSN： 1743-8225

Source： International Journal of Ad Hoc and Ubiquitous Computing, Vol.9, Iss.3, 2012-05, pp. : 133-141

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

An Algorithmic View on OVSF Code Assignment

By Erlebach Thomas   Jacob Riko   Mihalak Matus   Nunkesser Marc   Szabo Gabor   Widmayer Peter  

Algorithmica, Vol. 47, Iss. 3, 2007-04 ,pp. : 269-298

Springer Publishing Company

Access to resources Recommend Favorite

An Optimal Data Placement Strategy for Improving System Performance of Massive Data Applications Using Graph Clustering

By  

International Journal of Ambient Computing and Intelligence (IJACI), Vol. 9, Iss. 3, 2018-07 ,pp. : 15-30

IGI Global_journal

Access to resources Recommend Favorite

Optimal three-dimensional orthogonal graph drawing in the general position model

By Wood D.R.  

Theoretical Computer Science, Vol. 299, Iss. 1, 2003-04 ,pp. : 151-178

Elsevier

Access to resources Recommend Favorite

Time-Optimal Proximity Graph Computations on Enhanced Meshes

By Olariu S.   Stojmenovic I.   Zomaya A.Y.  

Journal of Parallel and Distributed Computing, Vol. 49, Iss. 2, 1998-03 ,pp. : 204-217

Academic Press

Access to resources Recommend Favorite

Optimal strategies against a liar

By Cicalese F.   Vaccaro U.  

Theoretical Computer Science, Vol. 230, Iss. 1, 2000-01 ,pp. : 167-193

Elsevier

Access to resources Recommend Favorite