default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDElif Tugce Ceran
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c12]Ömer Gençay, Alperen Balci, Elif Tugce Ceran, Elif Uysal:
Ensuring a Semantically Effective IoT Network Through Blockchain with Delayed Feedback. ICNC 2024: 88-92- [i9]Osman Nuri Irkiçatal, Elif Tugce Ceran, Melda Yuksel:
Deep Reinforcement Learning Enhanced Rate-Splitting Multiple Access for Interference Mitigation. CoRR abs/2403.05974 (2024) - 2023
- [j7]Aysenur Özkaya
, Ahsen Topbas, Elif Tugce Ceran:
Reinforcement Learning Based Adaptive Blocklength and MCS for Optimizing Age Violation Probability. IEEE Access 11: 122411-122425 (2023) - [j6]Zeynep Çakir, Elif Tugçe Ceran Arslan:
Unbiased federated learning in energy harvesting error-prone channels. Turkish J. Electr. Eng. Comput. Sci. 31(3): 612-625 (2023) - [c11]Osman Nuri Irkiçatal, Melda Yuksel, Elif Tugce Ceran:
Deep Reinforcement Learning Aided Rate-Splitting for Interference Channels. GLOBECOM 2023: 3735-3740 - [c10]Muratcan Ayik, Elif Tugce Ceran, Elif Uysal:
Optimization of AoII and QAoII in Multi-User Links. INFOCOM Workshops 2023: 1-6 - [i8]Muratcan Ayik, Elif Tugce Ceran, Elif Uysal:
Optimization of AoII and QAoII in Multi-User Links. CoRR abs/2305.00191 (2023) - 2022
- [j5]Tahir Kerem Oguz, Elif Tugçe Ceran, Elif Uysal, Tolga Girici:
Implementation and Evaluation of Age-Aware Downlink Scheduling Policies in Push-Based and Pull-Based Communication. Entropy 24(5): 673 (2022) - [c9]Zeynep Çakir, Elif Tugce Ceran:
Federated Learning with Channel and Energy Aware Scheduling. SIU 2022: 1-4 - [c8]Aysenur Özkaya, Elif Tugçe Ceran:
Minimizing Age Violation Probability with Adaptive Blocklength Selection in Short Packet Transmissions. SIU 2022: 1-4 - 2021
- [j4]Elif Tugçe Ceran, Deniz Gündüz, András György:
A Reinforcement Learning Approach to Age of Information in Multi-User Networks With HARQ. IEEE J. Sel. Areas Commun. 39(5): 1412-1426 (2021) - [c7]Orhan Tahir Yavascan, Elif Tugce Ceran, Zeynep Çakir, Onur Kaya, Elif Uysal:
When To Pull Data for Minimum Age Penalty. WiOpt 2021: 169-176 - [i7]Elif Tugce Ceran, Deniz Gündüz, András György:
A Reinforcement Learning Approach to Age of Information in Multi-User Networks with HARQ. CoRR abs/2102.09774 (2021) - [i6]Elif Tugce Ceran, Deniz Gündüz, András György:
Learning to Minimize Age of Information over an Unreliable Channel with Energy Harvesting. CoRR abs/2106.16037 (2021)
2010 – 2019
- 2019
- [j3]Elif Tugce Ceran, Deniz Gündüz, András György:
Average Age of Information With Hybrid ARQ Under a Resource Constraint. IEEE Trans. Wirel. Commun. 18(3): 1900-1913 (2019) - [c6]Elif Tugçe Ceran, Deniz Gündüz, András György:
Reinforcement Learning to Minimize Age of Information with an Energy Harvesting Sensor with HARQ and Sensing Cost. INFOCOM Workshops 2019: 656-661 - [i5]Elif Tugçe Ceran, Deniz Gündüz, András György:
Reinforcement Learning to Minimize Age of Information with an Energy Harvesting Sensor with HARQ and Sensing Cost. CoRR abs/1902.09467 (2019) - 2018
- [c5]Elif Tugce Ceran, Deniz Gündüz, András György:
A Reinforcement Learning Approach to Age of Information in Multi-User Networks. PIMRC 2018: 1967-1971 - [c4]Elif Tugce Ceran, Deniz Gündüz, András György:
Average age of information with hybrid ARQ under a resource constraint. WCNC 2018: 1-6 - [i4]Neyre Tekbiyik-Ersoy, Elif Tugce Ceran, Kemal Leblebicioglu, Tolga Girici, Elif Uysal-Biyikoglu:
Kalman Prediction Based Proportional Fair Resource Allocation for a Solar Powered Wireless Downlink. CoRR abs/1802.04338 (2018) - [i3]Elif Tugçe Ceran, Deniz Gündüz, András György:
A Reinforcement Learning Approach to Age of Information in Multi-User Networks. CoRR abs/1806.00336 (2018) - 2017
- [j2]Elif Tugce Ceran, Tugce Erkilic, Elif Uysal-Biyikoglu, Tolga Girici, Kemal Leblebicioglu:
Optimal energy allocation policies for a high altitude flying wireless access point. Trans. Emerg. Telecommun. Technol. 28(4) (2017) - [i2]Elif Tugce Ceran, Deniz Gündüz, András György:
Average Age of Information with Hybrid ARQ under a Resource Constraint. CoRR abs/1710.04971 (2017) - 2016
- [j1]Erol Gelenbe, Elif Tugce Ceran:
Energy Packet Networks With Energy Harvesting. IEEE Access 4: 1321-1331 (2016) - 2015
- [c3]Erol Gelenbe, Elif Tugce Ceran:
Central or distributed energy storage for processors with energy harvesting. SustainIT 2015: 1-3 - [c2]Baran Tan Bacinoglu, Elif Tugce Ceran, Elif Uysal-Biyikoglu:
Age of information under energy replenishment constraints. ITA 2015: 25-31 - [i1]Elif Tugce Ceran, Tugce Erkilic, Elif Uysal-Biyikoglu, Tolga Girici, Kemal Leblebicioglu:
Optimal Energy Allocation Policies for a High Altitude Flying Wireless Access Point. CoRR abs/1509.08304 (2015) - 2014
- [c1]Elif Tugce Ceran, Tugce Erkilic, Elif Uysal-Biyikoglu, Tolga Girici, Kemal Leblebicioglu:
Optimizing the service policy of a wireless access point on the move with renewable energy. Allerton 2014: 967-974
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-07-02 21:28 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:
