• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 284
  • 90
  • 31
  • 11
  • 11
  • 11
  • 11
  • 11
  • 11
  • 4
  • 4
  • 3
  • 2
  • 2
  • 2
  • Tagged with
  • 607
  • 607
  • 146
  • 87
  • 87
  • 71
  • 66
  • 65
  • 63
  • 61
  • 55
  • 52
  • 47
  • 47
  • 44
  • 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

A dataflow diagram generator

Specht, Alicia Ellen January 2010 (has links)
Typescript (photocopy). / Digitized by Kansas Correctional Industries / Department: Computer Science.
2

Multitasking in a user partition with a contour model of processes

Allen, Lee January 2010 (has links)
Digitized by Kansas Correctional Industries
3

Dynamic channel allocation /

Kaminsky, Andrew D. January 2003 (has links) (PDF)
Thesis (M.S. in Computer Science)--Naval Postgraduate School, September 2003. / Thesis advisor(s): John Gibson, Geoffrey Xie. Includes bibliographical references (p. 191-193). Also available online.
4

Computer explorations.

Howson, Hugh R. January 1971 (has links)
No description available.
5

A distributed graph reducer for lazy functional languages /

Howson, Christopher January 1992 (has links)
This thesis describes a model for distributed graph reduction implemented on a network of transputers. The model allows variable size communications between processors, by exchanging subgraphs instead of single nodes. Functional languages with lazy semantics have graph nodes representing unevaluated arguments. These nodes require special treatment by the run time system because they must not be copied. By checking the structure of the transmitted subgraphs, it is possible to determine which unevaluated expressions have no external references to them and so may safely be included in the subgraph with no overhead. This allows large subgraphs to be exchanged while reducing the demands on the communications system. This technique raises the possibility of implementations on a wide variety of distributed computers such as networks of workstations, which hitherto has been considered impractical.
6

Data structures for a fragment based programming environment

Pinsonneault, Luc January 1987 (has links)
No description available.
7

Cooperative bug isolation winning thesis of the 2005 ACM Doctoral Dissertation Competition /

Liblit, Ben. January 1900 (has links)
Revised Thesis (Ph. D.)--University of California, Berkeley, 2004. / Description based on print version record. Includes bibliographical references (p. 97-101) and index.
8

Cooperative bug isolation winning thesis of the 2005 ACM Doctoral Dissertation Competition /

Liblit, Ben. January 1900 (has links)
Revised Thesis (Ph. D.)--University of California, Berkeley, 2004. / In: MyiLibrary. Visionné le 1er mai 2009. Description based on print version record. Comprend des références bibliographiques.
9

Cooperative bug isolation winning thesis of the 2005 ACM Doctoral Dissertation Competition /

Liblit, Ben. January 1900 (has links)
Revised thesis (Ph.D.) - University of California, Berkeley, 2004. / Title from e-book title screen (viewed June 27, 2008). Includes bibliographical references (p. 97-101) and index.
10

Problems in designing digital systems using PLAs

Patel, Pankaj. January 1977 (has links)
Thesis--Wisconsin. / Includes bibliographical references.

Page generated in 0.1036 seconds