Sciweavers

    CP
    2011
    Springer
    178views Artificial Intelligence» more  CP 2011»
    CP Models for Maximum Common Subgraph Problems
    12 years 11 months ago
    CP Models for Maximum Common Subgraph Problems
    Download  liris.cnrs.fr
    The distance between two graphs is usually defined by means of the size of a largest common subgraph. This common subgraph may be an induced subgraph, obtained by removing nodes, ...
    Samba Ndojh Ndiaye, Christine Solnon
    claim paper
    Read More »
    AAAI
    2011
    233views Intelligent Agents» more  AAAI 2011»
    Adaptive Neighborhood Inverse Consistency as Lookahead for Non-Binary CSPs
    12 years 11 months ago
    Adaptive Neighborhood Inverse Consistency as Lookahead for Non-Binary CSPs
    Download  consystlab.unl.edu
    Freuder and Elfe (1996) introduced Neighborhood Inverse Consistency (NIC) for binary CSPs. In this paper, we introduce RNIC, the extension of NIC to nonbinary CSPs, and describe a...
    Robert J. Woodward, Shant Karakashian, Berthe Y. C...
    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.