Sciweavers

    858 search results - page 21 / 172
    » A Glimpse of Constraint Satisfaction
    Sort
    View
    AAAI
    2006
    113views Intelligent Agents» more  AAAI 2006»
    A New Approach to Distributed Task Assignment using Lagrangian Decomposition and Distributed Constraint Satisfaction
    13 years 9 months ago
    A New Approach to Distributed Task Assignment using Lagrangian Decomposition and Distributed Constraint Satisfaction
    Download  www.edu.kobe-u.ac.jp
    We present a new formulation of distributed task assignment, called Generalized Mutual Assignment Problem (GMAP), which is derived from an NP-hard combinatorial optimization probl...
    Katsutoshi Hirayama
    claim paper
    Read More »
    IJCAI
    1989
    124views Artificial Intelligence» more  IJCAI 1989»
    An Algebraic Approach to Constraint Satisfaction Problems
    13 years 8 months ago
    An Algebraic Approach to Constraint Satisfaction Problems
    Download  www.cs.cornell.edu
    A constraint satisfaction problem, or CSP, can be reformulated as an integer linear programming problem. The reformulated problem can be solved via polynomial multiplication. If t...
    Igor Rivin, Ramin Zabih
    claim paper
    Read More »
    JAIR
    2006
    131views more  JAIR 2006»
    Asynchronous Partial Overlay: A New Algorithm for Solving Distributed Constraint Satisfaction Problems
    13 years 7 months ago
    Asynchronous Partial Overlay: A New Algorithm for Solving Distributed Constraint Satisfaction Problems
    Download  www.jair.org
    Distributed Constraint Satisfaction (DCSP) has long been considered an important problem in multi-agent systems research. This is because many real-world problems can be represent...
    Roger Mailler, Victor R. Lesser
    claim paper
    Read More »
    AAAI
    1994
    106views Intelligent Agents» more  AAAI 1994»
    An Approach to Multiply Segmented Constraint Satisfaction Problems
    13 years 9 months ago
    An Approach to Multiply Segmented Constraint Satisfaction Problems
    Download  www.aaai.org
    This paper describes an extension to the constraint satisfaction problem (CSP) approach called MUSE CSP (Multiply SEgmented Constraint Satisfaction Problem). This extension is esp...
    Randall A. Helzerman, Mary P. Harper
    claim paper
    Read More »
    ASE
    1998
    81views more  ASE 1998»
    Program Understanding as Constraint Satisfaction: Representation and Reasoning Techniques
    13 years 7 months ago
    Program Understanding as Constraint Satisfaction: Representation and Reasoning Techniques
    Download  www.cse.ust.hk
    The process of understanding a source code in a high-level programming language involves complex computation. Given a piece of legacy code and a library of program plan templates, ...
    Steven G. Woods, Qiang Yang
    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.