Dynamic variable ordering in graph based backjumping algorithms for csps (Q4511615): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Network-based heuristics for constraint-satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree clustering for constraint networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduction operations for constraint satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Networks of constraints: Fundamental properties and applications to picture processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Sufficient Condition for Backtrack-Free Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backtrack programming techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimating the Efficiency of Backtrack Programs / rank
 
Normal rank

Latest revision as of 16:02, 30 May 2024

scientific article; zbMATH DE number 1523621
Language Label Description Also known as
English
Dynamic variable ordering in graph based backjumping algorithms for csps
scientific article; zbMATH DE number 1523621

    Statements

    Dynamic variable ordering in graph based backjumping algorithms for csps (English)
    0 references
    30 October 2000
    0 references
    constraint satisfaction problems
    0 references
    graph based backjumping
    0 references
    backtracking algorithm
    0 references

    Identifiers