Sciweavers

    IJCAI
    1993
    150views Artificial Intelligence» more  IJCAI 1993»
    Using Inferred Disjunctive Constraints To Decompose Constraint Satisfaction Problems
    14 years 26 days ago
    Using Inferred Disjunctive Constraints To Decompose Constraint Satisfaction Problems
    Download  ijcai.org
    Constraint satisfaction problems involve finding values for problem variables that satisfy constraints on what combinations of values are permitted. They have applications in many...
    Eugene C. Freuder, Paul D. Hubbe
    claim paper
    Read More »
    ECAI
    2008
    Springer
    111views Artificial Intelligence» more  ECAI 2008»
    A Decomposition Technique for Max-CSP
    14 years 1 months ago
    A Decomposition Technique for Max-CSP
    Download  www.cril.univ-artois.fr
    The objective of the Maximal Constraint Satisfaction Problem (Max-CSP) is to find an instantiation which minimizes the number of constraint violations in a constraint network. In t...
    Hachemi Bennaceur, Christophe Lecoutre, Olivier Ro...
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.