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
Demo Data from EDBT 2026 / reviewers in the wild / expert

Terry Liu

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

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

Artificial intelligence and machine learning · 1 · 1 since 2021Computer networks · 1

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%
Computer networks
1 paper
Internet architecture and protocols · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning › multi-agent reinforcement learning › value-based multi-agent reinforcement learning
multi-agent q-learning		 0.512021
QPLEX: Duplex Dueling Multi-Agent Q-Learning · ICLR 2021
Machine learning › Reinforcement learning
multi-agent reinforcement learning		 0.512021
QPLEX: Duplex Dueling Multi-Agent Q-Learning · ICLR 2021
Machine learning › Reinforcement learning
value-based reinforcement learning		 0.512021
QPLEX: Duplex Dueling Multi-Agent Q-Learning · ICLR 2021
Internet architecture and protocols
local area network		 0.011993
A robust broadband headend switching algorithm · IEEE Trans. Commun. 1993
Internet architecture and protocols › traffic management
traffic scheduling		 0.011993
A robust broadband headend switching algorithm · IEEE Trans. Commun. 1993
Performance modeling and evaluation › delay analysis
mean delay analysis		 0.011993
A robust broadband headend switching algorithm · IEEE Trans. Commun. 1993

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

q-learning · 0.5dueling network architecture · 0.5finite-horizon optimization · 0.0
YearPublicationVenuePosition
2021 QPLEX: Duplex Dueling Multi-Agent Q-Learning
Zhizhou Ren, Terry Liu, Yang Yu 0001, Chongjie Zhang
 ICLR3
1993 A robust broadband headend switching algorithm
abstract
Local area networks (LANs) with a branching rooted-tree topology are considered. In these systems, the metropolitan area gateway (MAG) is responsible for coordinating the flow of traffic into and out of the local subnetworks. A traffic scheduling technique is proposed for this topology. The algorithm is motivated by a finite-horizon maximization of conditional channel cycle utilization, resulting in a zero/infinite scheduling window scheme. Improved mean delay performance is achieved over a much wider range of traffic conditions than for other known algorithms. In order to obtain this robust behaviour, the local media access algorithms are modified to interact with the dynamic scheduling scheme in the MAG.>
Terry Todd 0001, Terry Liu, Desmond P. Taylor
 IEEE Trans. Commun.2