• 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.
181

Modelling events from natural language

Kent, Stuart John Harding January 1993 (has links)
No description available.
182

Technology mapping of heterogeneous lookup table based field programmable gate arrays

Inuani, Maurice Kilavuka January 1998 (has links)
A lot of work has been done over the last decade on the logic synthesis and technology mapping of field programmable gate arrays (FPGAs) based on a single size of lookup table (LUT). A significant part of the FPGA market is occupied by devices based on more than one type of lookup tables. Examples of these heterogeneous LUT-based FPGAs are the Xilinx 4000 series devices. The technology mapping for this class of FPGAs has hardly been considered. This thesis covers work on the synthesis for heterogeneous LUT-based FPGAs. The proposed scheme uses the typical steps of graph covering, decomposition, node elimination and Boolean graph simplification. The covering step is based on the concept of flow networks and cut-computation. A theory is devised that reduces the flow network sizes so that a dynamic programming approach can be used to compute the feasible cuts in the network. An iterative selection algorithm can then be used to compute the set cover of the network. For the decomposition, the conventional bin-packing (cube-packing) algorithm has been extended so that it produces two types of bins. It has also been enhanced to explore several packing possibilities and include cube division and cascading of nodes. The classical functional decomposition method is extended to heterogeneous graphs. In particular, variable partitioning is coupled with other decomposition methods and exploits the structure of the functions. Partial collapsing and re-decomposition are used to re-synthesise the graphs. A strategy for eliminating nodes within a heterogeneous graph is developed. A simplification strategy is also derived from logic optimisation techniques. Comparisons of the mapping results on Xilinx devices show an improvement of over 11% over existing mapping tools for the same devices.
183

Internal convex programming, orthogonal linear programming, and program generation procedures.

Ristroph, John Heard, January 1975 (has links)
Thesis (Ph. D.)--Virginia Polytechnic Institute, 1975. / Also available via the Internet.
184

A compiler-based approach to implementing smart pointers

Hoskins, Stephen. January 2007 (has links)
Thesis (M.S.)--George Mason University, 2007. / Title from PDF t.p. (viewed Jan. 18, 2008). Thesis director: Elizabeth White. Submitted in partial fulfillment of the requirements for the degree of Master of Science in Computer Science. Vita: p. 152. Includes bibliographical references (p. 150-151). Also available in print.
185

Implementation of an activity coordinator for an activity-based distributed system /

Shaw, Robert. January 1988 (has links)
Thesis (M.S.)--Rochester Institute of Technology, 1988. / Includes bibliographical references.
186

Inspections : software development process for building defect free software applied in a small-scale software development environment /

Sherwood, Patricia Ann. January 1990 (has links)
Thesis (M.S.)--Rochester Institute of Technology, 1990. / Spine title: Inspections applied in a small-scale development. Includes bibliographical references (leaves 38-39).
187

Automatic programming for digital computers /

Sanderson, John G., January 1900 (has links) (PDF)
Thesis (M.Sc.) -- University of Adelaide, 1958. / Typewritten copy.
188

Simbuilder an investigation and uability study of novice programming techniques /

Kanakadoss, Sumitha. Seals, Cheryl D. January 2005 (has links) (PDF)
Thesis(M.S.)--Auburn University, 2005. / Abstract. Includes bibliographic references (p.85-88).
189

Exploring the relationships among gender, learning style, mental model, and programming performance implications for learning and teaching of computer programming /

Lau, Wing-fat, January 2009 (has links)
Thesis (Ph. D.)--University of Hong Kong, 2009. / Includes bibliographical references (p. 218-232) Also available in print.
190

The effectiveness of using LEGO Mindstorms robotics activities to influence self-regulated learning in a university introductory computer programming course

McWhorter, William Isaac. O'Connor, Brian C., January 2008 (has links)
Thesis (Ph. D.)--University of North Texas, May, 2008. / Title from title page display. Includes bibliographical references.

Page generated in 0.1139 seconds