CoChat

A Hill Climbing Algorithm for Ground Station Scheduling

Xhafa, Fatos, Herrero, Xavier, Barolli, Admir, Takizawa, Makoto · 2013 · Lecture Notes in Electrical Engineering

The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.

Overview

Integrity signals

Registry

Crossref · 10.1007/978-94-007-6996-0_14

Cites

9 of 9 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Show all 9 references

Cited by

See all 1

Metadata

Authors
Xhafa, F., Herrero, X., Barolli, A., & Takizawa, M.
Affiliations
  • Universitat Politècnica de Catalunya (ES)
  • Canadian Institute of Technology (AL)
  • Hosei University (JP)
Corresponding author
Xhafa, Fatos
Venue
Lecture Notes in Electrical Engineering
Published
2013
Pages
131-139
ISSN
  • 1876-1100 (ISSN-L)
  • 1876-1119
OpenAlex
W2181916190
Cited by
1
References
9
Citations by year
2020: 1
FWCI
0.00
Type
book chapter
Language
en
Open access
closed
Licence
Locations
Lecture notes in electrical engineering (publishedVersion)
Topics
  • Physical Sciences › Engineering › Aerospace Engineering › Satellite Communication Systems
  • Physical Sciences › Computer Science › Artificial Intelligence › Constraint Satisfaction and Optimization
  • Social Sciences › Decision Sciences › Management Science and Operations Research › Scheduling and Timetabling Solutions
Keywords
ground station scheduling, hill climbing algorithm, local search, time window scheduling, satellite mission planning, resource constraints, combinatorial optimization

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: A Hill Climbing Algorithm for Ground Station Scheduling. https://app.cochat.ai/papers/10.1007/978-94-007-6996-0_14
The paper
Xhafa, F., Herrero, X., Barolli, A., & Takizawa, M. (2013). A Hill Climbing Algorithm for Ground Station Scheduling. Lecture Notes in Electrical Engineering. https://doi.org/10.1007/978-94-007-6996-0_14

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.