A genetic algorithm for university examination scheduling

Download
038590.pdf
1995
Ergül, Ayhan
Show full item record
56
views
0
downloads
https://hdl.handle.net/11511/11667
Graduate School of Natural and Applied Sciences, Thesis

Suggestions

A genetic algorithm for allocating units in land combat
Erdem, Ergin; Özdemirel, Nur Evin; Department of Industrial Engineering (2001)
A genetic algorithm for resource leveling of construction projects
Iranagh, Mahdi Abbasi; Sönmez, Rifat (2012-01-01)
Critical path method (CPM) is commonly used in scheduling of construction projects. However, CPM only considers the precedence relations between the activities and does not consider resource optimization during scheduling of projects. Optimal allocation of resources can be achieved by resource levelling. Resource levelling is crucial for effective use of construction resources particularly to minimize the project costs. However, commercial scheduling software has very limited capabilities for solving the re...
A Multiplex primer design algorithm for target amplification of continuous genomic regions
Öztürk, Ahmet Raşit; Can, Tolga; Department of Medical Informatics (2016)
Targeted Next Generation Sequencing (NGS) assays are cost-efficient and reliable alternatives to Sanger sequencing. For sequencing of very large set of genes, the target enrichment approach is suitable. However, for smaller genomic regions, the target amplification method is more efficient than both the target enrichment method and Sanger sequencing. The major difficulty of the target amplification method is the preparation of amplicons, regarding required time, equipment, and labor. Multiplex PCR (MPCR) is...
A multiplex primer design algorithm for target amplification of continuous genomic regions
OZTURK, Ahmet Rasit; Can, Tolga (2017-06-19)
Background: Targeted Next Generation Sequencing (NGS) assays are cost-efficient and reliable alternatives to Sanger sequencing. For sequencing of very large set of genes, the target enrichment approach is suitable. However, for smaller genomic regions, the target amplification method is more efficient than both the target enrichment method and Sanger sequencing. The major difficulty of the target amplification method is the preparation of amplicons, regarding required time, equipment, and labor. Multiplex P...
A binomial noised model for cluster validation
Toledano-Kitai, Dvora; Avros, Renata; Volkovich, Zeev; Weber, Gerhard Wilhelm; Yahalom, Orly (IOS Press, 2013-01-01)
Cluster validation is the task of estimating the quality of a given partition of a data set into clusters of similar objects. Normally, a clustering algorithm requires a desired number of clusters as a parameter. We consider the cluster validation problem of determining the optimal ("true") number of clusters. We adopt the stability testing approach, according to which, repeated applications of a given clustering algorithm provide similar results when the specified number of clusters is correct. To implemen...
Citation Formats
A. Ergül, “A genetic algorithm for university examination scheduling,” Middle East Technical University, 1995.
METU IIS - Integrated Information Service open@metu.edu.tr