default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHüseyin Aydin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j8]Melis Ilayda Bal
, Hüseyin Aydin, Cem Iyigün, Faruk Polat:
Potential-based reward shaping using state-space segmentation for efficiency in reinforcement learning. Future Gener. Comput. Syst. 157: 469-484 (2024)- [c4]Hüseyin Aydin:
Assisting Users in Privacy Conflicts with Partially Observable Multi-Agent Reinforcement Learning. HHAI 2024: 55-63 - 2022
- [b1]Hüseyin Aydin:
Using frequencies of transitions to improve reinforcement learningwith hidden states (Saklı durumlu pekiştirmeli öğrenmeyi geliştirmek için geçişlerinfrekanslarının kullanımı). Middle East Technical University, Turkey, 2022 - [j7]Hüseyin Aydin, Erkin Çilden, Faruk Polat:
Using chains of bottleneck transitions to decompose and solve reinforcement learning tasks with hidden states. Future Gener. Comput. Syst. 133: 153-168 (2022) - 2021
- [j6]Ekrem Yavuz, Yavuz Senol, Merih Özçelik, Hüseyin Aydin:
Design of a String Encoder-and-IMU-Based 6D Pose Measurement System for a Teaching Tool and Its Application in Teleoperation of a Robot Manipulator. J. Sensors 2021: 6678673:1-6678673:17 (2021)
2010 – 2019
- 2019
- [c3]Ekrem Yavuz, Yavuz Senol, Merih Özçelik, Hüseyin Aydin:
Design of a String-Encoder and IMU Based 6D Pose Measurement System. ECAI 2019: 1-6 - [c2]Hüseyin Aydin, Erkin Çilden, Faruk Polat:
Compact Frequency Memory for Reinforcement Learning with Hidden States. PRIMA 2019: 425-433 - 2017
- [c1]Hüseyin Aydin, Erkin Çilden, Faruk Polat:
Using Transitional Bottlenecks to Improve Learning in Nearest Sequence Memory Algorithm. ICTAI 2017: 147-152
2000 – 2009
- 2009
- [j5]Erdal Karaduman, Hüseyin Aydin:
k-nacci sequences in some special groups of finite order. Math. Comput. Model. 50(1-2): 53-58 (2009) - 2005
- [j4]Nurullah Ankaralioglu, Hüseyin Aydin, Inci Gültekin:
Computation of abstract groups S((d + 1)/2, d) and torus knots K(d, 2). Appl. Math. Comput. 167(1): 695-710 (2005) - 2003
- [j3]Erdal Karaduman, Hüseyin Aydin:
General 2-step Fibonacci sequences in nilpotent groups of exponent p and nilpotency class 4. Appl. Math. Comput. 141(2-3): 491-497 (2003) - [j2]Engin Özkan, Hüseyin Aydin, Ramazan Dikici:
Applications of Fibonacci sequences in a finite nilpotent group. Appl. Math. Comput. 141(2-3): 565-578 (2003) - [j1]Engin Özkan, Hüseyin Aydin, Ramazan Dikici:
3-Step Fibonacci series modulo m. Appl. Math. Comput. 143(1): 165-172 (2003)
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-08-05 21:24 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:
