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
Genetic Algorithms for Continuous Design Domain
Date
1999-11-10
Author
Dölen, Melik
Kayıkçı, Ekrem
Metadata
Show full item record
Item Usage Stats
52
views
0
downloads
Cite This
URI
https://hdl.handle.net/11511/79660
Collections
Unverified, Conference / Seminar
Suggestions
OpenMETU
Core
Genetic algorithms for distributed database design and distributed database query optimization
Sevinç, Ender; Coşar, Ahmet; Department of Computer Engineering (2009)
The increasing performance of computers, reduced prices and ability to connect systems with low cost gigabit ethernet LAN and ATM WAN networks make distributed database systems an attractive research area. However, the complexity of distributed database query optimization is still a limiting factor. Optimal techniques, such as dynamic programming, used in centralized database query optimization are not feasible because of the increased problem size. The recently developed genetic algorithm (GA) based optimi...
Genetic algorithm for the multiple-query optimization problem
Bayir, Murat Ali; Toroslu, İsmail Hakkı; Coşar, Ahmet (2007-01-01)
Producing answers to a set of queries with common tasks efficiently is known as the multiple-query optimization (MQO) problem. Each query can have several alternative evaluation plans, each with a different set of tasks. Therefore, the goal of MQO is to choose the right set of plans for queries which minimizes the total execution time by performing common tasks only once. Since MQO is an NP-hard problem, several, mostly heuristics based, solutions have been proposed for solving it. To the best of our knowle...
Genetic algorithm for constrained optimization models and its application in groundwater resources management
Guan, Jiabao; Kentel Erdoğan, Elçin; Aral, Mustafa M. (American Society of Civil Engineers (ASCE), 2008-01-01)
Genetic algorithms (GAs) have been shown to be an efficient tool for the solution of unconstrained optimization problems. In their standard form, GA formulations are "blind" to the constraints of an optimization model when the model involves these constraints. Thus, in GA applications alternative procedures are used to satisfy the constraints of the optimization model. In this study, the method that is utilized in the Complex Algorithm to solve constrained optimization problems is abstracted to develop a re...
Genetic Algorithm Application to the Structural Properties of Si-Ge Mixed Clusters
Dugan, Nazim; Erkoç, Şakir (Informa UK Limited, 2009-01-01)
Optimum geometries of silicon-germanium (Si-Ge) clusters are found using a single parent genetic algorithm. 100 atom and 150 atom clusters are studied with some variety of compositions and initial geometries. Total interaction energies, distances of Si and Ge atoms to the cluster centers, and average bond lengths are calculated. Si-core Ge-shell geometry is found to be favorable compared to other geometries.
Genetic algorithm approach for the optimization of technical trading rule parameters.
Hülagü, Timur; Selçuk, Sevtap; Department of Statistics (2001)
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
M. Dölen and E. Kayıkçı, “Genetic Algorithms for Continuous Design Domain,” 1999, vol. 9, Accessed: 00, 2021. [Online]. Available: https://hdl.handle.net/11511/79660.