On the Optimum Communication Cost Problem in Interconnection Networks

Name: On the Optimum Communication Cost Problem in Interconnection Networks
Brand: VDM Verlag
SKU: 9783639114461
Price: 50.97 EUR
Availability: InStock

Finding Near-Optimum Solutions for Topology Design Problems Using Randomized Algorithms

Автор: Khalid Al-Zamil

Език:

Корици: С меки корици

Издател: VDM Verlag

Наличност: Налично при издателя, по поръчка

Изпращаме след 17-27 дни

50.97 € 99.68 лв

In the Optimum Communication Spanning Tree (OCST) §problem, a spanning tree for a complete graph has...

Информация за книгата

Автор

Khalid Al-Zamil

Език

Английски език

Корици

Книга - С меки корици

Издадена

2009

страници

EAN

9783639114461

ISBN

3639114469

Enbook ID

06820317

Издател

VDM Verlag

Теглоt

141

Размери

152 x 229 x 5

Пълно описание

In the Optimum Communication Spanning Tree (OCST) §problem, a spanning tree for a complete graph has to §be found that satisfies the communication §requirements needed by the vertices with a minimum §total cost. A special case of the OCST problem is §the Optimum Distance Spanning Tree (ODST) problem, §where the requirements are restricted to be §constant. Both problems are known to be NP-hard. In §this book, a randomized algorithm has been proposed §to efficiently solve two special cases of the ODST §problem. This can be achieved by randomly generating §spanning trees with certain properties. This book §also includes the history of the OCST problem along §with a literature survey. This is in addition to a §discussion on the different deterministic algorithms §that exist for enumerating all spanning trees of a §graph. An empirical study has been conducted that §showed that the proposed algorithm can yield near-§optimum solutions. The experiments involve testing §the proposed algorithm to solve these special cases §using several randomly generated graphs, in addition §to the hypercube and butterfly network topologies to §some specified dimension.

Може също да ви хареса

Клиенти, които купиха тази книга, купиха също

Най-често търсени

Categories

Authors

Publishers

Продукти

Продукти

Най-често търсени

Categories

Authors

Publishers

Продукти

Продукти

On the Optimum Communication Cost Problem in Interconnection Networks

Finding Near-Optimum Solutions for Topology Design Problems Using Randomized Algorithms

Информация за книгата

Пълно описание

Може също да ви хареса

Case of the Dotty Dowager

Hot Wheels Let's Race: 5-Minute Stories

Church's Healing Ministry

Clinical Biomechanics in Human Locomotion

Suzuki Violin School, Vol 5: Violin Part

Beginning of Wisdom

Globalisation and European Integration

HEARN CONCSE HSTRY 20TH CENT INST BK

Spring Persistence with Hibernate

Art Nouveau

Nonlinear Functional Analysis and its Applications

Клиенти, които купиха тази книга, купиха също

Syst mes de Gestion de Production Et Syst mes de Contr le de Gestion

Secrets of a Prayer Warrior - FRENCH

SAP R/3 Vertrieb. ( IDES Rel. 4.0)

Cours Elementaire d'Histoire Naturelle. Zoologie

Varningen

Dans l'ombre des choses - Lettres d'un humaniste impénitent

Bismarck

Hyperurikamie, Gicht Und Andere Stoerungen Des Purinhaushalts

La bruja Ring Ring 4. La magia del norte