Designing Sorting Networks [recurso electrónico] : A New Paradigm / by Sherenaz W. Al-Haj Baddar, Kenneth E. Batcher.

Por: Al-Haj Baddar, Sherenaz W [author.]Colaborador(es): Batcher, Kenneth E [author.] | SpringerLink (Online service)Tipo de material: TextoTextoEditor: New York, NY : Springer New York, 2011Descripción: XII, 136 p. online resourceTipo de contenido: text Tipo de medio: computer Tipo de portador: online resourceISBN: 9781461418511Tema(s): Computer science | Data structures (Computer science) | Computer Science | Data Structures | Arithmetic and Logic Structures | Models and PrinciplesFormatos físicos adicionales: Printed edition:: Sin títuloClasificación CDD: 005.73 Clasificación LoC:QA76.9.D35Recursos en línea: Libro electrónicoTexto
Contenidos:
Preface -- Early History -- Software Implementations -- POSETS -- The 0/1-Principle -- A 16-Key Sorting Network -- The Sortnet Program -- Divide & Conquer -- Counting Strangers -- Finding Better Networks -- Lattice Theory -- The AKS Sorting Network -- Ideas For Faster Networks -- BOOL(N) -- Sorting Networks For Large N -- Another Way Of Handling Strangers -- Thoughts On Minimizing Strangers -- Case Studies -- Appendix I: Proofs of Theorems -- Index.
En: Springer eBooksResumen: Designing Sorting Networks: A New Paradigm provides an in-depth guide to maximizing the efficiency of sorting networks, and uses 0/1 cases, partially ordered sets and Haase diagrams to closely analyze their behavior in an easy, intuitive manner. This book also outlines new ideas and techniques for designing faster sorting networks using Sortnet, and illustrates how these techniques were used to design faster 12-key and 18-key sorting networks through a series of case studies. Finally, it examines and explains the mysterious behavior exhibited by the fastest-known 9-step 16-key network. Designing Sorting Networks: A New Paradigm is intended for advanced-level students, researchers and practitioners as a reference book. Academics in the fields of computer science, engineering and mathematics will also find this book invaluable.
Star ratings
    Valoración media: 0.0 (0 votos)
Existencias
Tipo de ítem Biblioteca actual Colección Signatura Copia número Estado Fecha de vencimiento Código de barras
Libro Electrónico Biblioteca Electrónica
Colección de Libros Electrónicos QA76.9 .D35 (Browse shelf(Abre debajo)) 1 No para préstamo 372477-2001

Preface -- Early History -- Software Implementations -- POSETS -- The 0/1-Principle -- A 16-Key Sorting Network -- The Sortnet Program -- Divide & Conquer -- Counting Strangers -- Finding Better Networks -- Lattice Theory -- The AKS Sorting Network -- Ideas For Faster Networks -- BOOL(N) -- Sorting Networks For Large N -- Another Way Of Handling Strangers -- Thoughts On Minimizing Strangers -- Case Studies -- Appendix I: Proofs of Theorems -- Index.

Designing Sorting Networks: A New Paradigm provides an in-depth guide to maximizing the efficiency of sorting networks, and uses 0/1 cases, partially ordered sets and Haase diagrams to closely analyze their behavior in an easy, intuitive manner. This book also outlines new ideas and techniques for designing faster sorting networks using Sortnet, and illustrates how these techniques were used to design faster 12-key and 18-key sorting networks through a series of case studies. Finally, it examines and explains the mysterious behavior exhibited by the fastest-known 9-step 16-key network. Designing Sorting Networks: A New Paradigm is intended for advanced-level students, researchers and practitioners as a reference book. Academics in the fields of computer science, engineering and mathematics will also find this book invaluable.

19

Con tecnología Koha