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

MARC

LEADER 00000nam a22000005i 4500
001 978-1-4614-1851-1
003 DE-He213
005 20220117100641.0
007 cr nn 008mamaa
008 111103s2011 xxu| s |||| 0|eng d
020 |a 9781461418511  |9 978-1-4614-1851-1 
024 7 |a 10.1007/978-1-4614-1851-1  |2 doi 
050 4 |a Q336 
072 7 |a UN  |2 bicssc 
072 7 |a COM062000  |2 bisacsh 
072 7 |a UN  |2 thema 
082 0 4 |a 005.7  |2 23 
100 1 |a Al-Haj Baddar, Sherenaz W.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
245 1 0 |a Designing Sorting Networks  |h [electronic resource] :  |b A New Paradigm /  |c by Sherenaz W. Al-Haj Baddar, Kenneth E. Batcher. 
250 |a 1st ed. 2011. 
264 1 |a New York, NY :  |b Springer New York :  |b Imprint: Springer,  |c 2011. 
300 |a XII, 136 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
505 0 |a 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. 
520 |a 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. 
650 0 |a Artificial intelligence-Data processing. 
650 0 |a Computer arithmetic and logic units. 
650 0 |a Computer science. 
650 1 4 |a Data Science. 
650 2 4 |a Arithmetic and Logic Structures. 
650 2 4 |a Models of Computation. 
700 1 |a Batcher, Kenneth E.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9781489989901 
776 0 8 |i Printed edition:  |z 9781461418504 
776 0 8 |i Printed edition:  |z 9781461418528 
856 4 0 |u https://doi.uam.elogim.com/10.1007/978-1-4614-1851-1  |z Texto Completo 
912 |a ZDB-2-SCS 
912 |a ZDB-2-SXCS 
950 |a Computer Science (SpringerNature-11645) 
950 |a Computer Science (R0) (SpringerNature-43710) 

Ejemplares similares