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 VLDB 2026 / reviewers in the wild / expert

Clark A. Mount-Campbell

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

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

Computer 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.

Computer networks
1 paper
Vehicular, aerial and satellite networks · 50% Optical networks · 50%
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
Optical networks
heuristic optimization		 0.011990
Finding fixed satellite service orbital allotments with a k-permutation algorithm · IEEE Trans. Commun. 1990
Vehicular, aerial and satellite networks
satellite communication		 0.011990
Finding fixed satellite service orbital allotments with a k-permutation algorithm · IEEE Trans. Commun. 1990
Mathematical optimization › discrete optimization
mixed integer linear programming		 0.011990
Finding fixed satellite service orbital allotments with a k-permutation algorithm · IEEE Trans. Commun. 1990

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

k-permutation algorithm · 0.0heuristic search · 0.0
YearPublicationVenuePosition
1990 Finding fixed satellite service orbital allotments with a k-permutation algorithm
abstract
A satellite system synthesis problem, the satellite location problem (SLP), is addressed. In SLP, orbital locations (longitudes) are allotted to geostationary satellites in the fixed satellite service. A linear mixed-integer programming model is presented that views SLP as a combination of two problems: the problem of ordering the satellites and the problem of locating the satellites given some ordering. A special-purpose heuristic procedure, a k-permutation algorithm, that has been developed to find solutions to SLPs formulated in the manner suggested is described. Solutions to small example problems are presented and analyzed on the basis of calculated interferences.>
Charles H. Reilly, David J. A. Gonsalvez, Clark A. Mount-Campbell
 IEEE Trans. Commun.3