Cantitate/Preț
Produs

Multi-Layer Channel Routing

Autor R.K. Pal
en Limba Engleză Hardback – 27 sep 2000
This book focuses on computation complexity and design of algorithms f or multi-layer channel routing. In particular, it deals with various l arge-scale, computationally intensive optimization problems that have specific applications in many technology-supported routing models. The author includes numerous examples and exercises along with many hard- copy solutions that illustration the feasibility of different routing solutions. He also mentions several problems that remain open, pointin g the way for future research.
Citește tot Restrânge

Preț: 66473 lei

Preț vechi: 82066 lei
-19% Nou

Puncte Express: 997

Preț estimativ în valută:
12721 13340$ 10607£

Indisponibil temporar

Doresc să fiu notificat când acest titlu va fi disponibil:

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9780849309311
ISBN-10: 084930931X
Pagini: 440
Dimensiuni: 144 x 221 x 36 mm
Greutate: 0.79 kg
Ediția:1
Editura: Narosa Publishing House
Colecția Imprints CRC Press - only for PT Products!

Textul de pe ultima copertă

This book focuses on computation complexity and design of algorithms for multi-layer channel routing. In particular, it deals with various large-scale, computationally intensive optimization problems that have specific applications in many technology-supported routing models. The author includes numerous examples and exercises along with many hard-copy solutions that illustration the feasibility of different routing solutions. He also mentions several problems that remain open, pointing the way for future research.

Descriere

This book offers an in-depth study and investigation into channel routing using multiple layers of interconnection. In particular, it deals with various large-scale, computationally intensive optimization problems that have specific applications in many technology-supported routing models. The author includes numerous examples and exercises along with many hard-copy solutions that illustrate the feasibility of different routing solutions. He also proposes efficient polynomial time heuristics for problem solving and mentions several problems that remain open, pointing the way for future research.