Towards objective measures of algorithm performance across instance space (Q336954): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(12 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cor.2013.11.015 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: SATzilla / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: House of Graphs / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Hyperheuristics / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: NetworkX / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: DIMACS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GraPHedron / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2071948161 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q62033354 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Needed: An Empirical Science of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing heuristics: We have it all wrong / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Effects of Coefficient Correlation Structure in Two-Dimensional Knapsack Problems on Solution Procedure Performance / rank
 
Normal rank
Property / cites work
 
Property / cites work: A no-free-lunch theorem for non-uniform distributions of target functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measuring instance difficulty for combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discovering the suitability of optimisation algorithms by learning from evolved instances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring the role of graph spectra in graph coloring algorithm performance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating Applicable Synthetic Instances for Branch Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A wide-ranging computational comparison of high-performance graph colouring algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: PYTHIA / rank
 
Normal rank
Property / cites work
 
Property / cites work: GAUSS: an online algorithm selection system for numerical quadrature / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning dynamic algorithm portfolios / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principal component analysis. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-organized formation of topologically correct feature maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 10.1162/153244303322753634 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 10.1162/153244303322753616 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph-based hyper-heuristic for educational timetabling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of metaheuristic-based techniques for university timetabling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some models of graphs for scheduling sports competitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223159 / rank
 
Normal rank
Property / cites work
 
Property / cites work: House of Graphs: a database of interesting graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facet defining inequalities among graph invariants: The system graphedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: Use of the Szeged index and the revised Szeged index for measuring network bipartivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The energy of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873761 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New methods to color the vertices of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for finding a maximum clique in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid evolutionary algorithms for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph coloring heuristic using partial solutions and a reactive tabu scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved ant colony optimisation heuristic for graph colouring / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/cor/Smith-MilesBWL14 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COR.2013.11.015 / rank
 
Normal rank

Latest revision as of 14:46, 9 December 2024

scientific article
Language Label Description Also known as
English
Towards objective measures of algorithm performance across instance space
scientific article

    Statements

    Towards objective measures of algorithm performance across instance space (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 November 2016
    0 references
    comparative analysis
    0 references
    heuristics
    0 references
    graph coloring
    0 references
    algorithm selection
    0 references
    performance prediction
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers