Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
A genetic algorithm for allocating units in land combat
Download
116131.pdf
Date
2001
Author
Erdem, Ergin
Metadata
Show full item record
Item Usage Stats
73
views
0
downloads
Cite This
URI
https://hdl.handle.net/11511/11500
Collections
Graduate School of Natural and Applied Sciences, Thesis
Suggestions
OpenMETU
Core
A genetic algorithm for university examination scheduling
Ergül, Ayhan; Oğuztüzün, Halit; Department of Computer Engineering (1995)
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 heuristic algorithm for hierarchical representation of form documents
Duygulu, P; Atalay, Mehmet Volkan; Dincel, E (1998-08-20)
In this paper our aim is to develop a logical representation for form documents. We propose a hierarchical structure to represent the logical layout of a form by using lines. The approach is top-down and no domain knowledge such as the preprinted data or filled-in data is used. Logically same but physically different forms are associated to the same hierarchical tree. This representation can handle geometrical modifications and slight variations.(1).
A heuristic algorithm for optical character recognition of Arabic script
Yarman Vural, Fatoş T.; Atici, A. Alper (1996-03-20)
In this paper, a heuristic method is developed for segmentation, feature extraction and recognition of the Arabic script. The study is part of a large project for the transcription of the documents in Ottoman Archives. A geometrical and topological feature analysis method is developed for segmentation and feature extraction stages. Chain code transformation is applied to main strokes of the characters which are then classified by the hidden Markov model (HMM) in the recognition stage. Experimental results i...
A heuristic algorithm for optical character recognition of Arabic script
Atici, A. Alper; Yarman Vural, Fatoş T. (1997-10-01)
In this paper, a heuristic method is developed for segmentation, feature extraction and recognition of the Arabic script. The study is part of a large project for transcription of the documents in Ottoman Archives. A geometrical and topological feature analysis method is developed for segmentation and feature extraction stages. Chain code transformation is applied to main strokes of the characters, which are classified by the hidden Markov model (HMM) in the recognition stage. Experimental results indicate ...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
E. Erdem, “A genetic algorithm for allocating units in land combat,” Middle East Technical University, 2001.