CoChat

Improvement Strategies for the F-Race Algorithm: Sampling Design and Iterative Refinement

Balaprakash, Prasanna, Birattari, Mauro, Stützle, Thomas · 2007 · Lecture Notes in Computer Science

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

Overview

Integrity signals

Registry

Crossref · 10.1007/978-3-540-75514-2_9

Cites

22 of 22 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 22 references

Research works printed but not linked: 1

  1. Boyan, J., Moore, A.: Using prediction to improve combinatorial optimization search. In: Sixth International Workshop on Artificial Intelligence and Statistics (1997)

Cited by

See all 197

Metadata

Authors
Balaprakash, P., Birattari, M., & Stützle, T.
Affiliations
Université Libre de Bruxelles (BE)
Venue
Lecture Notes in Computer Science
Published
2007-09-19
Pages
108-122
OpenAlex
W1504954800
Cited by
197
References
23
Citations by year
2025: 5 · 2024: 8 · 2023: 13 · 2022: 9 · 2021: 18 · 2020: 17 · 2019: 11 · 2018: 17 · 2017: 17 · 2016: 5 · 2015: 11 · 2014: 15 · 2013: 16 · 2012: 9
FWCI
4.11
Type
conference paper
Language
en
Open access
closed
Locations
Springer eBooks (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Metaheuristic Optimization Algorithms Research
  • Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Data Classification
  • Physical Sciences › Computer Science › Artificial Intelligence › Evolutionary Algorithms and Applications
Keywords
auto-tuning, sampling design, iterative refinement, stochastic local search

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: Improvement Strategies for the F-Race Algorithm: Sampling Design and Iterative Refinement. https://app.cochat.ai/papers/10.1007/978-3-540-75514-2_9
The paper
Balaprakash, P., Birattari, M., & Stützle, T. (2007). Improvement Strategies for the F-Race Algorithm: Sampling Design and Iterative Refinement. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-540-75514-2_9

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.