Sciweavers

    1453 search results - page 57 / 291
    » Partial Constraint Satisfaction
    Sort
    View
    DRW
    2003
    96views Mathematics» more  DRW 2003»
    Linear Phase Transition in Random Linear Constraint Satisfaction Problems
    14 years 11 months ago
    Linear Phase Transition in Random Linear Constraint Satisfaction Problems
    Download  www.univie.ac.at
    David Gamarnik
    claim paper
    Read More »
    IJCAI
    2003
    85views Artificial Intelligence» more  IJCAI 2003»
    Splitting the atom: A new approach to Neighbourhood Interchangeability in Constraint Satisfaction Problems
    14 years 11 months ago
    Splitting the atom: A new approach to Neighbourhood Interchangeability in Constraint Satisfaction Problems
    Download  www.comp.nus.edu.sg
    We investigate interchangeability of values in CSPs, based on an approach where a single value in the domain of a variable can be treated as a combination of “sub-values”. An ...
    James Bowen, Chavalit Likitvivatanavong
    claim paper
    Read More »
    IJCAI
    1997
    94views Artificial Intelligence» more  IJCAI 1997»
    Combining Local Search and Look-Ahead for Scheduling and Constraint Satisfaction Problems
    14 years 11 months ago
    Combining Local Search and Look-Ahead for Scheduling and Constraint Satisfaction Problems
    Download  www.diegm.uniud.it
    Andrea Schaerf
    claim paper
    Read More »
    AAAI
    1996
    101views Intelligent Agents» more  AAAI 1996»
    Inference-Based Constraint Satisfaction Supports Explanation
    14 years 11 months ago
    Inference-Based Constraint Satisfaction Supports Explanation
    Download  www.aaai.org
    Mohammed H. Sqalli, Eugene C. Freuder
    claim paper
    Read More »
    AAAI
    1996
    119views Intelligent Agents» more  AAAI 1996»
    Enhancements of Branch and Bound Methods for the Maximal Constraint Satisfaction Problem
    14 years 11 months ago
    Enhancements of Branch and Bound Methods for the Maximal Constraint Satisfaction Problem
    Download  www.aaai.org
    Two methods are described for enhancing performance of branch and bound methods for overconstrained CSPS. These methods improve either the upper or lower bound, respectively, duri...
    Richard J. Wallace
    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-2025, USA.