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

Noralifah Annuar

dblp:209/2551 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2018
—ORCID · unresolved

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

Computer networks · 1 · 1 first-author

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.

Computer networks
1 paper
Internet of things and sensor networks · 100%
Theoretical computer science
1 paper
Mathematical optimization · 100%

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

TopicWeightPapersLastEvidence papers
Internet of things and sensor networks › wireless sensor network › data collection
energy-efficient data collection		 0.312018
Energy efficient mobile data collection from sensor networks with range-dependent data rates: poster abstract · IPSN 2018
Internet of things and sensor networks › wireless sensor network › data collection
mobile data gathering		 0.312018
Energy efficient mobile data collection from sensor networks with range-dependent data rates: poster abstract · IPSN 2018
Mathematical optimization
linear programming		 0.112018
Energy efficient mobile data collection from sensor networks with range-dependent data rates: poster abstract · IPSN 2018

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

linear programming · 0.7gradient descent · 0.7
YearPublicationVenuePosition
2018 Energy efficient mobile data collection from sensor networks with range-dependent data rates: poster abstract
abstract
This work presents a variation of a data collection problem referred as TSP-Data Collection (TSP-DC). Previously we have demonstrated that a two-stage algorithm using Linear-Programming Optimization and Gradient-Descent Optimization (LPO-GDO) is able to solve TSP-DC for minimum tour time. This poster abstract shows that LPO-GDO is also able to solve TSP-DC for an objective function of minimum energy, giving different solutions for different relative energy costs of data transmission and sink movement, and for high or low data loads at sensor nodes.
Noralifah Annuar, Neil W. Bergmann, Raja Jurdak, Branislav Kusy
 IPSN1