Global ETD Search

321	A practical distributed garbage collection algorithm for message passing network with message delay 關振德, Kwan, Chun-tak. January 1996 (has links) published_or_final_version / Computer Science / Master / Master of Philosophy Memory management (Computer science) Computer networks. Computer algorithms.
322	Efficient algorithms for semantic net construction and maintenance Cheung, Kai-man, Felix, 張繼文 January 2002 (has links) published_or_final_version / Computer Science and Information Systems / Master / Master of Philosophy Subject headings. Computer algorithms.
323	Efficient solutions for the load distribution problem 邱祖淇, Yau, Cho-ki, Joe. January 1999 (has links) published_or_final_version / Computer Science and Information Systems / Master / Master of Philosophy Computer algorithms. Parallel computers.
324	Topics in parallel integer optimization Linderoth, Jeffrey T. 08 1900 (has links) No description available. Linear programming Computer algorithms
325	Strategic level assessment of the benefit of reductions in equipment conversion times Lillo, Nancy L. 12 1900 (has links) No description available. Assembly-line methods Flexible manufacturing systems Computer algorithms
326	Perceptual coding of audio and diverse speech signals Trinkaus, Trevor R. 12 1900 (has links) No description available. Signal processing Digital techniques Computer sound processing Computer algorithms
327	Trellis based soft output decoding algorithms for concatenated coding systems Park, Jong Il 05 1900 (has links) No description available. Decoders (Electronics) Computer algorithms
328	A Turing machines simulator using a Microsoft Windows' interface Atger, Dominique January 1993 (has links) The purpose of this thesis is to develop a software system simulating Turing machines using a Microsoft Windows' Interface.Developed in the 1930's by Alan Turing and Emil Post, Turing machines are defined as "abstract computers" . These machines seem able to solve all problems a modern computer can solve, however complex the problems may be. A Turing machine is a basic computational model for algorithms.The software provides a practical tool to students with a relative notion of Turing machines. The software contains introduction and general information on Turing machines that gives the beginner enough background to use the program. The user can create, modify or run Turing machines saved onto MS-DOS files. Some examples of Turing machines are preloaded. These examples give more help to the beginner.An on-line help facility is provided in order to direct and inform the learning student at each level of the software.The Microsoft Windows' Interface makes the software easy and friendly to use. The software has the modularity which will ease any future enhancement. / Department of Computer Science Turing machines -- Computer programs. Computer algorithms. Microsoft Windows (Computer file)
329	A study and implementation of some visibility graph algorithms Alanazi, Zeyad M. January 1994 (has links) In recent years extensive research has been done on visibility graphs. In this thesis, we study some of the visibility graph algorithms, and implement these algorithms in the graph editor - GraphPerfect - which is a part of a project headed by Dr. Jay S. Bagga of the Department of computer science at Ball State University. One of the goals of this project is to design and build a software tool to learn and work with graphs and graph algorithms.In this thesis, some properties of visibility graphs are studied in detail and implementation of some graph algorithms is given. / Department of Computer Science Graphic methods -- Computer programs. Computer algorithms. Geometry -- Data processing. Algorithms.
330	Expert-gate algorithm Joshi, Varad Vidyadhar 23 November 1992 (has links) The goal of Inductive Learning is to produce general rules from a set of seen examples, which can then be applied to other unseen examples. ID3 is an inductive learning algorithm that can be used for the classification task. The input to the algorithm is a set of tuples of description and class. The ID3 algorithm learns a decision tree from these input examples, which can then be used for classifying unseen examples given their descriptions. ID3 faces a problem called the replication problem. An algorithm called the Expert-Gate algorithm is presented in this thesis. The aim of the algorithm is to tackle the replication problem. We discuss the various issues involved with each step of the algorithm and present results corroborating our choices. The algorithm was tested on various artificially created problems as well as on a real life problem. The performance of the algorithm was compared with that of Fringe. The algorithm was found to give excellent results on the artificially created problems. The Expert-Gate algorithm gave satisfactory results on the NETtalk problem. Overall, we believe the algorithm is a good candidate for testing on other real life domains. / Graduation date: 1993 Computer algorithms Machine learning

Search results