Algorithm portfolios
Open accessThe claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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?
The adaptive allocation approach is related to algorithm portfolios, Successive Halving, Hyperband, and asynchronous early-stopping methods such as ASHA.
“This approach is related to algorithm portfolios (Gomes & Selman, 2001), Successive Halving (Jamieson & Talwalkar, 2016), Hyperband (Li et al., 2018), and asynchronous early-stopping methods such as ASHA (Li et al., 2020)”
From Automated Discovery Has No Universally Superior Harness (2026) · cites this paper as Gomes & Selman, 2001
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Cites
No references could be resolved yet.
Research works printed but not linked: 19
- D. Aldous, U. Vazirani, Go with the winners algorithms, in: Proc. 35th Symposium on the Found. of Comp. Sci., IEEE Press, 1994, pp. 492-501.
- D. Brelaz, New methods to color the vertices of a graph, Comm. ACM 22 (4) (1979) 251-256.
- T. Dean, M. Boddy, An analysis of time-dependent planning, in: Proc. AAAI-88, St. Paul, MN, 1988, pp. 49-54.
- J. Denes, A. Keedwell, Latin Squares and their Applications, Akademiai Kiado, Budapest/English Universities Press, London, 1974.
- W. Ertel, M. Luby, Optimal parallelization of Las Vegas algorithms, in: Proc. Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, Vol. 775, Springer, Berlin, 1994, pp. 463-475.
- M. Fujita, J. Slaney, F. Bennett, Automatic generation of some results in finite algebra, in: Proc. IJCAI-93, Chambéry, France, AAAI Press, Menlo Park, CA, 1993, pp. 52-57.
- C.P. Gomes, B. Selman, Algorithm portfolio design: Theory vs. practice, in: Proc. 13th Conference on Uncertainty in Artificial Intelligence (UAI-97), Providence, RI, Morgan Kaufmann, San Mateo, CA, 1997, pp. 190-197.
- C.P. Gomes, B. Selman, Problem structure in the presence of perturbations, in: Proc. AAAI-97, Providence, RI, AAAI Press, Menlo Park, CA, 1997, pp. 221-227.
- C.P. Gomes, B. Selman, N. Crato, Heavy-tailed distributions in combinatorial search, in: G. Smolka (Ed.), Principles and Practice of Constraint Programming (CP'97), Linz, Austria, Lecture Notes in Computer Science, Springer, Berlin, 1997, pp. 121-135.
- C.P. Gomes, B. Selman, H. Kautz, Boosting combinatorial search through randomization, in: Proc. AAAI- 98, Providence, RI, AAAI Press, Menlo Park, CA, 1998, pp. 431-438.
- E. Horvitz, S.Z. (Eds.), Proceedings of Flexible Computation, Technical Report, AAAI Fall Symposium, 1995.
- H. Kautz, B. Selman, Unifying SAT-based and graph-based planning, in: T. Dean (Ed.), Proc. IJCAI-99, Stockholm, Sweden, Morgan Kaufmann, San Mateo, CA, 1999, pp. 318-325.
- H. Kautz, J. Walser, State-space planning by integer optimization, in: Proc. AAAI-99, Orlando, FL, AAAI Press, Menlo Park, CA, 1999, pp. 526-533.
- R. Motwani, P. Raghavan, Randomized Algorithms, Cambridge University Press, Cambridge, England, 1995.
- J.F. Puget, M. Leconte, Beyond the black box: Constraints as objects, in: Proc. ILPS'95, Lisbon, Portugal, MIT Press, Cambridge, MA, 1995, pp. 513-527.
- S. Russell, P. Norvig, Artificial Intelligence: A Modern Approach, Prentice Hall, Englewood Cliffs, NJ, 1995.
- F.S. Salman, J.R. Kalagnanam, A. Davenport, Cooperative strategies for solving the bicriteria sparse multiple knapsack problem, in: Proc. Congress on Evolutionary Computation, 1999, pp. 53-60.
- M. Trick, D.J. (Eds.), Proc. DIMACS Challenge on Satisfiability Testing, Graph Coloring, and Cliques, DIMACS Series on Discr. Math., Am. Math. Soc., Providence, RI, 1996.
- T. Vossen, M. Ball, A. Lotem, D. Nau, Integer programming models in AI planning, Technical Report, Workshop on Planning as Combinatorial Search (held in conjunction with AIPS-98), Pittsburgh, PA, 1999.
Cited by
Sorted by citations
Automated Discovery Has No Universally Superior Harness
Gupta, A., Lei, J., Lu, A., Anumanchipalli, G., & Choshen, L. (2026) · arXiv · doi:10.48550/arxiv.2607.18235
- Authors
- Gomes, C. P., & Selman, B.
- Affiliations
- Cornell University (US)
- Corresponding author
- Gomes, Carla P.
- Venue
- Artificial Intelligence
- Publisher
- Elsevier BV
- Published
- 2001-02
- Volume
- 126
- Issue
- 1-2
- Pages
- 43-62
- ISSN
- 0004-3702 (ISSN-L)
- OpenAlex
- W2914775474
- Cited by
- 461
- References
- 0
- Citations by year
- 2026: 8 · 2025: 10 · 2024: 5 · 2023: 10 · 2022: 13 · 2021: 22 · 2020: 14 · 2019: 17 · 2018: 24 · 2017: 23 · 2016: 30 · 2015: 34 · 2014: 36 · 2013: 33 · 2012: 33
- FWCI
- 7.57
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Licence
- Locations
- Artificial Intelligence (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Constraint Satisfaction and Optimization
- Physical Sciences › Computer Science › Artificial Intelligence › Metaheuristic Optimization Algorithms Research
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
- Keywords
- algorithm portfolios, stochastic algorithms, random search, combinatorial search, mixed integer programming
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
