• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 54
  • 8
  • 8
  • 1
  • Tagged with
  • 87
  • 87
  • 87
  • 87
  • 26
  • 23
  • 16
  • 14
  • 13
  • 13
  • 12
  • 12
  • 12
  • 10
  • 9
  • 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.
41

Hemşire çizelgeleme problemlerinin genetik algoritma ile çözümü /

Çivril, Hanife. Uzunkavak, Mehmet. January 2009 (has links) (PDF)
Tez (Yüksek Lisans) - Süleyman Demirel Üniversitesi, Fen Bilimleri Enstitüsü, Elektronik Bilgisayar Eğitimi Anabilim Dalı, 2009. / Kaynakça var.
42

Object-oriented distributed and parallel I/O streams

Dick, Andrew J. January 1999 (has links)
Thesis (M. Sc.)--York University, 1999. Department of Computer Science. / Typescript. Includes bibliographical references (leaves. Also available on the Internet. MODE OF ACCESS via web browser by entering the following URL: http://wwwlib.umi.com/cr/yorku/fullcit?pMQ39189.
43

A trace-driven simulation study of cache memories

Xiong, Bo January 1989 (has links)
The purpose of this study is to explore the relationship between hit ratio of cache memory and design parameters. Cache memories are widely used in the design of computer system architectures to match relatively slow memories against fast CPUs. Caches hold the active segments of a program which are currently in use. Since instructions and data in cache memories can be referenced much faster than the time required to access main memory, cache memories permit the execution rate of the machine to be substantially increased. In order to function effectively, cache memories must be carefully designed and implemented. In this study, a trace-driven simulation study of direct mapped, associative mapped and set-associative mapped cache memories is made. In the simulation, cache fetch algorithm, placement policy, cache size and various parameters related to cache design and the resulting effect on system performance is investigated. The cache memories are simulated using the C language and the simulation results are analyzed for the design and implementation of cache memories. / Department of Physics and Astronomy
44

The J-shell command language interpreter

Tollefson, Bradley A. January 1985 (has links)
A command language interpreter (CLI) translates commands entered by the user into system actions. The shell is a specific type of CLI that was originally designed and used with UNIX operating systems.The author proposes to design and implement a shell-like CLI on top of the VMS operating system. The shell will enhance VMS features by providing an easier to use syntax and by providing features that are not currently available through VMS. These features include piping facilities and the ability to enter and/or reference multiple commands from a single command line. A language reference manual is provided with the J-shell. This manual explains the features and commands of the J-shell.
45

Developing a rule-based expert system with C programming language

Kuo, Yung-Li January 1988 (has links)
Expert system techniques are now being incorporated successfully in commercial computer software packages. This thesis introduces the techniques of developing a rule-based expert system in a general-purpose programming language -- C. The topics of this thesis include significance of expert system shells and approaches used, structure of the knowledge base, loading of the knowledge base, manipulation of the probabilities of rule attributes, and implementation of the inference engine. The inference engine uses the information that users supply to find an object that matches. Today C language is one of the most popular programming languages in use and C compilers consistently produce extremely fast and efficient executable programs. Thisthesisdemonstrates that C language is an appropriate computer language for a rule-based expert system. / Department of Computer Science
46

Run-time comparison C++ vs. Java

Jones, Linwood D. January 1999 (has links)
C++ is one of the most commonly used programming languages in academic and professional environments. Java is a relatively new language that is rapidly gaining popularity and acceptance. Java's designers claim that Java offers all the functionality of C++ and more. Java's syntax is similar to C++, but Java code is not compatible with C++. Java offers platform independence and better support for internet-oriented applications. Platform independence may come at a price. A major concern regarding any language is performance.This thesis looks at the performance of Java and C++. A comparison is made of C++ and Java runtimes for a simple algorithm (bubblesort). It covers the differences in compilation of an application developed in C++ versus an application developed in Java. It reports the execution time of an algorithm written in both languages. / Department of Computer Science
47

Expressing imaging algorithms using a C++ based image algebra programming environment /

Gupta, Davender Nath. January 1990 (has links)
Thesis (M.S.--Rochester Institute of Technology, 1990. / Includes bibliographical references.
48

Visor++ : a software visualisation tool for task-parallel object-orientated programs /

Widjaja, Hendra. January 1998 (has links) (PDF)
Thesis (M.App.Sc.)--University of Adelaide, Dept. of Computer Science, 1998? / Bibliography: leaves 173-184.
49

Reverse engineering of UML sequence diagrams using dynamic information /

Miao, Yucong, January 1900 (has links)
Thesis (M. Sc.)--Carleton University, 2003. / Includes bibliographical references (p. 77-79). Also available in electronic format on the Internet.
50

New techniques for parallel simulation of DEVS and cell-DEVS models in CD++ /

Glinsky, Ezequiel, January 1900 (has links)
Thesis (M.App.Sc.) - Carleton University, 2005. / Includes bibliographical references (p. 143-149). Also available in electronic format on the Internet.

Page generated in 0.0969 seconds