<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0">
<channel>
<title>Bilgisayar Programcılığı Bildiri &amp; Sunum Koleksiyonu</title>
<link>https://hdl.handle.net/20.500.12294/1597</link>
<description>Bilgisayar Programcılığı Programına ait bildiri ve sunumlar bu koleksiyonda listelenir.</description>
<pubDate>Sat, 23 May 2026 20:28:19 GMT</pubDate>
<dc:date>2026-05-23T20:28:19Z</dc:date>
<item>
<title>Gaussian Applications in Organic Structured Electronic Systems</title>
<link>https://hdl.handle.net/20.500.12294/3249</link>
<description>Gaussian Applications in Organic Structured Electronic Systems
Idman, Ebru; Idman, Emrah; Yildirim, Osman
The purpose of this research is to explore the molecular energy of organic structures in the form of nanoparticles with Gaussian W09 software. For this purpose, the structures of 2PANI ES-X in the literature were analyzed with Gaussian W09. Organic semiconductors have been explored since the last 60 years [1]. Ching W. Tang was first considered the father of organic electronics, since he found the organic light emitting diode (OLED) in the 1980s. Tang later broke ground to produce organic solar cells with his OLED research [2]-[3]. Subsequent studies investigated organic electroluminescence, organic photovoltaic cells, effective transistors that received organic thin film, and organic transistor models were developed [4]-[6]. It is known that they have the potential to be used in conductive polymers, sensors, energy converter, rechargeable batteries, photochemical cells, batteries and fuel cells, electrochromic tools and ion selective electrodes, and a protective cover against electromagnetic interference. In summary, conductive polymers will be the conductors of the future. © 2020 IEEE.
</description>
<pubDate>Wed, 01 Jan 2020 00:00:00 GMT</pubDate>
<guid isPermaLink="false">https://hdl.handle.net/20.500.12294/3249</guid>
<dc:date>2020-01-01T00:00:00Z</dc:date>
</item>
<item>
<title>Solving asymmetric traveling salesman problem using genetic algorithm</title>
<link>https://hdl.handle.net/20.500.12294/2036</link>
<description>Solving asymmetric traveling salesman problem using genetic algorithm
Birtane Akar, Sibel; Şahingöz, O.K.
This study describes the genetic algorithm method that is most commonly used in search and optimization studies with solution approach of the asymmetric travelling salesman problem, which is the leading problem of the complex problems and a different model of the traveling salesman problem. The proposed system has been put forward the test results and the system has been shown to provide an acceptable period of time with an effective solution environment. © 2015 IEEE.
2015 23rd Signal Processing and Communications Applications Conference, SIU 2015 -- 16 May 2015 through 19 May 2015 --
</description>
<pubDate>Thu, 01 Jan 2015 00:00:00 GMT</pubDate>
<guid isPermaLink="false">https://hdl.handle.net/20.500.12294/2036</guid>
<dc:date>2015-01-01T00:00:00Z</dc:date>
</item>
<item>
<title>İnsansız Hava Araçları ile Büyük Ölçekli Kablosuz Algılayıcı Ağlardan Veri Toplanması</title>
<link>https://hdl.handle.net/20.500.12294/1985</link>
<description>İnsansız Hava Araçları ile Büyük Ölçekli Kablosuz Algılayıcı Ağlardan Veri Toplanması
Birtane, Sibel; Şahingöz, Özgür Koray
Nowadays, with the developing technology, the use of Unmanned Aerial Vehicles (UAVs) has become quite common. With the increase in the use of UAVs in the military and civilian area, the studies in UAVs are also increasing. Minimizing the costs and improving safety play an important role in the development of these systems according to different terms of use. UAV route planning is quite a difficult problem when multiple tasks exist that contain the multiple target point and also considering the constraints of the environment. The aim of this study is to achieve appropriate route planning with UAVs in a Wireless Sensor network environment, to collect data on the nodes. In MATLAB, implementation is reviewed with genetic algorithm method in a three-dimensional radar threatened environment. And obtained results shows that the proposed model is fast and produce an acceptable solution. © 2016 IEEE.
24th Signal Processing and Communication Application Conference, SIU 2016 -- 16 May 2016 through 19 May 2016 --
</description>
<pubDate>Fri, 01 Jan 2016 00:00:00 GMT</pubDate>
<guid isPermaLink="false">https://hdl.handle.net/20.500.12294/1985</guid>
<dc:date>2016-01-01T00:00:00Z</dc:date>
</item>
<item>
<title>En Kısa Yol Problemi Üzerinde Karınca Kolonisi Algoritmasının Performansının İncelenmesi (Ege Denizi Örneği)</title>
<link>https://hdl.handle.net/20.500.12294/1928</link>
<description>En Kısa Yol Problemi Üzerinde Karınca Kolonisi Algoritmasının Performansının İncelenmesi (Ege Denizi Örneği)
İnan, Timur; Baba, A. Fevzi
The ant colony algorithm is an intuitive algorithm and one of the most frequently used problem solving algorithms. The problem of finding the shortest route is an important subject in important areas such as shipping, aviation, defense and freight forwarding. The study carries out the use of the ant colony algorithm on a route decision support system. In this study the shortest path was determined by the ant colony algorithm in the decision making stage to go from one node to the other on the Aegean sea. The results obtained are examined in terms of time, accuracy, and factors affecting the performance of the ant colony algorithm like pheromone amount, pheromone update, influence coefficents of pheromone and tour distance of ants. © 2018 IEEE.
4th Electric Electronics, Computer Science, Biomedical Engineerings' Meeting, EBBT 2018 -- 18 April 2018 through 19 April 2018 --
</description>
<pubDate>Mon, 01 Jan 2018 00:00:00 GMT</pubDate>
<guid isPermaLink="false">https://hdl.handle.net/20.500.12294/1928</guid>
<dc:date>2018-01-01T00:00:00Z</dc:date>
</item>
</channel>
</rss>
