Sciweavers

    419 search results - page 21 / 84
    » An LP-Designed Algorithm for Constraint Satisfaction
    Sort
    View
    PROCEDIA
    2011
    251views Pattern Recognition» more  PROCEDIA 2011»
    Exact Closest String as a Constraint Satisfaction Problem
    12 years 11 months ago
    Exact Closest String as a Constraint Satisfaction Problem
    Download  www.cs.st-andrews.ac.uk
    We report the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration of symbol occurrenc...
    Tom Kelsey, Lars Kotthoff
    claim paper
    Read More »
    AAAI
    1997
    139views Intelligent Agents» more  AAAI 1997»
    Dynamic Prioritization of Complex Agents in Distributed Constraint Satisfaction Problems
    13 years 9 months ago
    Dynamic Prioritization of Complex Agents in Distributed Constraint Satisfaction Problems
    Download  www.aaai.org
    Cooperative distributed problem solving (CDPS) loosely-coupledagentscan be effectively modeledas a distributed constraint satisfaction problem(DCSP) whereeach agent has multiple l...
    Aaron A. Armstrong, Edmund H. Durfee
    claim paper
    Read More »
    FLAIRS
    2003
    120views Artificial Intelligence» more  FLAIRS 2003»
    On the Computation of Local Interchangeability in Soft Constraint Satisfaction Problems
    13 years 9 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 »
    AAAI
    1998
    152views Intelligent Agents» more  AAAI 1998»
    On the Conversion between Non-Binary and Binary Constraint Satisfaction Problems
    13 years 9 months ago
    On the Conversion between Non-Binary and Binary Constraint Satisfaction Problems
    Download  www.cse.unl.edu
    It is well known that any non-binary discrete constraint satisfaction problem (CSP) can be translated into an equivalent binary CSP. Two translations are known: the dual graph tra...
    Fahiem Bacchus, Peter van Beek
    claim paper
    Read More »
    CONSTRAINTS
    1998
    127views more  CONSTRAINTS 1998»
    Experimental Analysis of Numeric and Symbolic Constraint Satisfaction Techniques for Temporal Reasoning
    13 years 8 months ago
    Experimental Analysis of Numeric and Symbolic Constraint Satisfaction Techniques for Temporal Reasoning
    Download  www.loria.fr
    Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed ...
    Malek Mouhoub, François Charpillet, Jean Pa...
    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.