Dynamic and static algorithms for optimal placement of resources in a tree

Author： Auletta V.   Parente D.   Persiano G.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.165, Iss.2, 1996-10, pp. : 441-461

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

Algorithms for Web service selection with static and dynamic requirements

By Canali Claudia  

Service Oriented Computing and Applications, Vol. 7, Iss. 1, 2013-03 ,pp. : 43-57

Springer Publishing Company

Access to resources Recommend Favorite

Blind Source Recovery in a State-Space Famework: Algorithms for Static and Dynamic Environments

By SALEM FATHI   WAHEED KHURRAM   ERTEN GAIL  

Neural Processing Letters, Vol. 21, Iss. 3, 2005-06 ,pp. : 153-173

Springer Publishing Company

Access to resources Recommend Favorite

From static content to dynamic communities: the evolution of networked educational resources

By Jacobs Neil   Huxley Lesly  

Online Information Review, Vol. 26, Iss. 1, 2002-03 ,pp. : 19-29

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

Optimal sensor placement for modal identification of structures using genetic algorithms—a case study: the olympic stadium in Cali, Colombia

By Cruz A.  

Annals of Operations Research, Vol. 181, Iss. 1, 2010-12 ,pp. : 769-781

Springer Publishing Company

Access to resources Recommend Favorite

High Performance CGM-based Parallel Algorithms for the Optimal Binary Search Tree Problem

By  

International Journal of Grid and High Performance Computing (IJGHPC), Vol. 8, Iss. 4, 2016-10 ,pp. : 55-77

IGI Global_journal

Access to resources Recommend Favorite