default search action
Göktürk Üçoluk
Person information
- affiliation: Middle East Technical University, Ankara, Turkey
- affiliation (former): Bogaziçi University, Istanbul, Turkey
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
- [j10]Ipek Gürsel Dino
, Göktürk Üçoluk:
Multiobjective Design Optimization of Building Space Layout, Energy, and Daylighting Performance. J. Comput. Civ. Eng. 31(5) (2017) - 2015
- [j9]Fatih Gökçe, Göktürk Üçoluk, Erol Sahin, Sinan Kalkan:
Vision-Based Detection and Distance Estimation of Micro Unmanned Aerial Vehicles. Sensors 15(9): 23805-23846 (2015) - 2013
- [c10]Arslan Arslan, Göktürk Üçoluk:
DARWIN: A Genetic Algorithm Language. ISCIS 2013: 35-44 - 2012
- [b1]Göktürk Üçoluk, Sinan Kalkan
Introduction to Programming Concepts with Case Studies in Python. Springer 2012, ISBN 978-3-7091-1342-4, pp. I-X, 1-221 - 2010
- [c9]Burçin Sapaz, Ismail Hakki Toroslu
A Genetic Algorithm Approach to the Artillery Target Assignment Problem. ISCIS 2010: 39-42
2000 – 2009
- 2008
- [j8]Ismail Hakki Toroslu
Authors' response to "an addendum on the incremental assignment problem" by Volgenant. Inf. Sci. 178(23): 4584 (2008) - 2007
- [j7]Erol Sahin
To Afford or Not to Afford: A New Formalization of Affordances Toward Affordance-Based Robot Control. Adapt. Behav. 15(4): 447-472 (2007) - [j6]Ismail H. Toroslu
Incremental assignment problem. Inf. Sci. 177(6): 1523-1529 (2007) - 2004
- [j5]Emin Erkan Korkmaz
A controlled genetic programming approach for the deceptive domain. IEEE Trans. Syst. Man Cybern. Part B 34(4): 1730-1742 (2004) - 2003
- [c8]Emin Erkan Korkmaz, Göktürk Üçoluk:
Design and Usage of a New Benchmark Problem for Genetic Programming. ISCIS 2003: 561-567 - [c7]Meltem Turhan Yöndem, Göktürk Üçoluk:
A Realistic Success Criterion for Discourse Segmentation. ISCIS 2003: 592-600 - [c6]Onur Tolga Sehitoglu, Göktürk Üçoluk:
Gene Level Concurrency in Genetic Algorithms. ISCIS 2003: 976-983 - 2002
- [j4]Göktürk Üçoluk:
Genetic Algorithm Solution of the TSP Avoiding Special Crossover and Mutation. Intell. Autom. Soft Comput. 8(3): 265-272 (2002) - [c5]Emin Erkan Korkmaz, Göktürk Üçoluk:
Controlled Genetic Programming Search for Solving Deceptive Problems. GECCO Late Breaking Papers 2002: 295-300 - [c4]Emin Erkan Korkmaz, Göktürk Üçoluk:
Controlling The Genetic Programming Search. GECCO 2002: 891
1990 – 1999
- 1999
- [j3]Göktürk Üçoluk, Ismail Hakki Toroslu
Automatic reconstruction of broken 3-D surface objects. Comput. Graph. 23(4): 573-582 (1999) - 1998
- [c3]Emin Erkan Korkmaz, Göktürk Üçoluk:
Choosing a Distance Metric for Automatic Word Categorization. CoNLL 1998: 111-120 - 1997
- [j2]Göktürk Üçoluk, Ismail Hakki Toroslu
A genetic algorithm approach for verification of the syllable-based text compression technique. J. Inf. Sci. 23(5): 365-372 (1997) - [c2]Göktürk Üçoluk, Ismail Hakki Toroslu:
Reconstruction of 3-D surface object from its pieces. CCCG 1997 - [c1]Emin Erkan Korkmaz, Göktürk Üçoluk:
Method for Improving Automatic Word Categorization. CoNLL 1997: 43-49
1980 – 1989
- 1982
- [j1]Göktürk Üçoluk, A. Hacinliyan, E. Karabudak:
A proposal for extensions to reduce. SIGSAM Bull. 16(2): 4-14 (1982)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: