Designing Sorting Networks A New Paradigm /

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 d...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autores principales: Al-Haj Baddar, Sherenaz W. (Autor), Batcher, Kenneth E. (Autor)
Autor Corporativo: SpringerLink (Online service)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: New York, NY : Springer New York : Imprint: Springer, 2011.
Edición:1st ed. 2011.
Temas:
Artificial intelligence-Data processing.
Computer arithmetic and logic units.
Computer science.
Data Science.
Arithmetic and Logic Structures.
Models of Computation.
Acceso en línea:Texto Completo
Tabla de 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.

Ejemplares similares