Peste 4 milioane de titluri în engleză și alte limbi! Descoperă-ți noua poveste astăzi!

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: 254.3 RON
Availability: InStock

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

Autor: Khalid Al-Zamil

Limbă:

Legare: Carte broșată

Editura: VDM Verlag

Disponibilitate: La editor doar la comandă

Expediem în 17-27 zile

254.30 lei

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

Informații despre carte

Autor

Khalid Al-Zamil

Limbă

engleză

Legare

Carte - Carte broșată

Publicat

2009

Pagini

EAN

9783639114461

ISBN

3639114469

Enbook ID

06820317

Editura

VDM Verlag

Greutate

141

Dimensiuni

152 x 229 x 5

Descriere completă

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.

Cele mai căutate

Categories

Authors

Publishers

Produse

Produse

Cele mai căutate

Categories

Authors

Publishers

Produse

Produse

On the Optimum Communication Cost Problem in Interconnection Networks

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

Informații despre carte

Descriere completă

S-ar putea să te intereseze

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

Clienții care au cumpărat această carte au mai cumpărat și

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