A formal analysis of why heuristic functions work (Q2457670): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3994799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998716 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical profile estimation in database systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4382646 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Automata - A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2755109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Efficiency of Histogram-like Techniques for Database Query Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph partitioning using learning automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4328550 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4510169 / rank
 
Normal rank

Revision as of 10:41, 27 June 2024

scientific article
Language Label Description Also known as
English
A formal analysis of why heuristic functions work
scientific article

    Statements

    A formal analysis of why heuristic functions work (English)
    0 references
    0 references
    0 references
    23 October 2007
    0 references
    A\(^*\) algorithms
    0 references
    heuristic algorithms
    0 references
    pattern recognition
    0 references
    optimization
    0 references

    Identifiers