Sciweavers

    95
    Voted
    FLAIRS
    2003
    120views Artificial Intelligence» more  FLAIRS 2003»
    On the Computation of Local Interchangeability in Soft Constraint Satisfaction Problems
    15 years 4 months ago
    On the Computation of Local Interchangeability in Soft Constraint Satisfaction Problems
    Download  www.aaai.org
    Freuder in (1991) defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently (2002), we extended the definition of interchangeability to Soft CSP...
    Nicoleta Neagu, Stefano Bistarelli, Boi Faltings
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.