• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 763
  • 170
  • 24
  • 21
  • 21
  • 21
  • 21
  • 21
  • 21
  • 6
  • 6
  • 4
  • 1
  • 1
  • Tagged with
  • 2872
  • 2872
  • 2521
  • 2129
  • 1312
  • 553
  • 527
  • 462
  • 443
  • 382
  • 373
  • 306
  • 262
  • 223
  • 208
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Algebraic study of generalization and redundancy of the bitonic sorter.

January 2003 (has links)
Qian Zhengfeng. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2003. / Includes bibliographical references (leaves 127-129). / Abstracts in English and Chinese. / Chapter Chapter 1 --- Groundwork --- p.1 / Chapter 1.1 --- Introduction --- p.1 / Chapter 1.2 --- Exchange Patterns --- p.5 / Chapter 1.3 --- Multistage Networks --- p.9 / Chapter 1.3.1 --- Multistage Networks --- p.9 / Chapter 1.3.2 --- Banyan-type Networks --- p.11 / Chapter 1.4 --- Networks of Sorting Cells --- p.15 / Chapter 1.5 --- Symbolic Representation and Matrix Representation --- p.19 / Chapter 1.5.1 --- Symbolic Representation of a Multistage Interconnection Network --- p.19 / Chapter 1.5.2 --- Symbolic Representation of a Network of Sorting Cells --- p.21 / Chapter 1.5.3 --- Matrix Representation of a Network of Sorting Cells --- p.22 / Chapter 1.6 --- Summary --- p.24 / Chapter Chapter 2 --- Construction of Generalized Bitonic Sorters by Merging Rotated Monotonic Sequences --- p.25 / Chapter 2.1 --- Merging Networks --- p.25 / Chapter 2.1.1 --- Recursive 2-stage Construction --- p.26 / Chapter 2.1.2 --- UC/CU Non-blocking Switches --- p.35 / Chapter 2.1.3 --- Circular Sorters and Merging Networks --- p.41 / Chapter 2.2 --- Construction of Generalized Bitonic Sorters --- p.48 / Chapter 2.2.1 --- Bitonic Ar-sorters and Bitonic Dr-sorters --- p.48 / Chapter 2.2.2 --- Algorithms for Construction of Generalized Bitonic Sorters by Merging Rotated Monotonic Sequences --- p.51 / Chapter 2.3 --- Summary --- p.73 / Chapter Chapter 3 --- Construction of Generalized Bitonic Sorters by Cross-k Cell Rearrangement --- p.74 / Chapter 3.1 --- Cross-k Cell Rearrangement on a Multistage Network --- p.74 / Chapter 3.1.1 --- Intra-stage Cell Rearrangement --- p.74 / Chapter 3.1.2 --- Equivalence of Networks --- p.77 / Chapter 3.1.3 --- Cross-k Cell Rearrangement --- p.80 / Chapter 3.2 --- Construction of Generalized Bitonic Sorters --- p.85 / Chapter 3.3 --- Summary --- p.99 / Chapter Chapter 4 --- Redundancy of the Bitonic Network --- p.100 / Chapter 4.1 --- Counting of Identified Generalized Bitonic Sorters --- p.100 / Chapter 4.2 --- Redundancy of the Bitonic Network --- p.110 / Epilogue --- p.112 / Appendix C Program for Exhaustive Search of 8×8 Generalized Bitonic Sorters --- p.113 / References --- p.127
2

Clyde : a system generator for the PDP11

Litwin, Barry Alan January 1977 (has links)
No description available.
3

A parsing method for context-free tree languages /

Schimpf, Karl Max. January 1900 (has links)
Thesis (Ph. D.)--University of Pennsylvania, 1982. / Cover title. Includes bibliographical references.
4

Application of a parallel processor system to QUICKSORT

Tamirisa, Gopalachary. January 1983 (has links)
No description available.
5

Clyde : a system generator for the PDP11

Litwin, Barry Alan January 1977 (has links)
No description available.
6

A lexical scanner generator for a modular compiler generation system

Venema, Tjeerd January 1975 (has links)
Much work has been done in the many aspects of compiler generation. He examine the problems associated with the generation of a full compiler and present a method of modular construction which would solve many of the problems which occur in previous generation systems. As an example of this modular construction, a lexical scanner generator is designed to produce lexical scanners which are easily interfaceable with the other components of a compiler. / Science, Faculty of / Computer Science, Department of / Graduate
7

Application of a parallel processor system to QUICKSORT

Tamirisa, Gopalachary. January 1983 (has links)
No description available.
8

COMPILER OF FUNCTIONAL REGISTER AND MSI/SSI WIRELIST REALIZATION FOR UNIVERSAL AHPL.

Liu, Limin. January 1984 (has links)
No description available.
9

An inherently concurrent language : a translator

Siang, Chunmei Liou January 2010 (has links)
Typescript (photocopy). / Digitized by Kansas Correctional Industries
10

Extensibility of lexical analyzers

Anderson, Gary Glenn January 2010 (has links)
Digitized by Kansas Correctional Industries

Page generated in 0.0743 seconds