Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ioannis G. Papageorgiou

dblp:122/9720 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
1since 2021 · last 2022
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Reinforcement learning · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning
markov decision process
0.612022
SIFTER: Space-Efficient Value Iteration for Finite-Horizon MDPs · Proc. VLDB Endow. 2022
Machine learning › Reinforcement learning
dynamic programming
0.212022
SIFTER: Space-Efficient Value Iteration for Finite-Horizon MDPs · Proc. VLDB Endow. 2022

Methods — techniques the papers use, named apart from their topics

value iteration · 0.6approximation techniques · 0.6
YearPublicationVenuePosition
2022 SIFTER: Space-Efficient Value Iteration for Finite-Horizon MDPs
abstract
Can we solve finite-horizon Markov decision processes (FHMDPs) while raising low memory requirements? Such models find application in many cases where a decision-making agent needs to act in a probabilistic environment, from resource management to medicine to service provisioning. However, computing optimal policies such an agent should follow by dynamic programming value iteration raises either prohibitive space complexity, or, in reverse, non-scalable time complexity requirements. This scalability question has been largely neglected. In this paper, we propose SIFTER (Space Efficient Finite Horizon MDPs), a suite of algorithms that achieve a golden middle between space and time requirements. Our former algorithm raises space complexity growing with the square root of the horizon's length without a time-complexity overhead, while the latter's space requirements depend only logarithmically in horizon length with a corresponding logarithmic time complexity overhead. A thorough experimental study under diverse settings confirms that SIFTER algorithms achieve the predicted gains, while approximation techniques do not achieve the same combination of time efficiency, space efficiency, and result quality.
Constantinos Skitsas, Ioannis G. Papageorgiou, Mohammad Sadegh Talebi, Verena Kantere, Michael N. Katehakis, Panagiotis Karras
Proc. VLDB Endow.2
2005 An enhanced received signal level cellular location determination method via maximum likelihood and Kalman filtering
abstract
The paper presents a new two-step cellular location determination (CLD) method based on signal strength and wave scattering models. The received signal level (RSL) method is first used in combination with maximum likelihood estimation (MLE) and triangulation to obtain an estimate of the location of the mobile. Due to non line of sight (NLOS) conditions and multipath propagation, this estimate lacks acceptable accuracy and consistency for demanding services, as numerical simulations reveal. Thus, the wave scattering 3D multipath channel model of Aulin is employed together with extended Kalman filtering (EKF) to obtain improved location estimates with high accuracy. The EKF is initialized at the MLE obtained from the RSL method, which is proved to be highly appropriate. Numerical simulations under urban, suburban and rural environments were utilized to evaluate the accuracy and consistency of the proposed two-step enhanced RSL method; the results of the worst-case rural environment are presented.
Ioannis G. Papageorgiou, Charalambos D. Charalambous, Christoforos Panayiotou
WCNC1