Sciweavers

    IJCAI
    1993
    150views Artificial Intelligence» more  IJCAI 1993»
    Using Inferred Disjunctive Constraints To Decompose Constraint Satisfaction Problems
    13 years 5 months ago
    Using Inferred Disjunctive Constraints To Decompose Constraint Satisfaction Problems
    Download  ijcai.org
    Constraint satisfaction problems involve finding values for problem variables that satisfy constraints on what combinations of values are permitted. They have applications in many...
    Eugene C. Freuder, Paul D. Hubbe
    claim paper
    Read More »
    IJCAI
    1993
    99views Artificial Intelligence» more  IJCAI 1993»
    Diagnosing and Solving Over-Determined Constraint Satisfaction Problems
    13 years 5 months ago
    Diagnosing and Solving Over-Determined Constraint Satisfaction Problems
    Download  dli.iiit.ac.in
    Constraint relaxation is a frequently used technique for managing over-determined constraint satisfaction problems. A problem in constraint relaxation is the selection of the appr...
    R. R. Bakker, F. Dikker, F. Tempelman, P. M. Wognu...
    claim paper
    Read More »
    AAAI
    1994
    126views Intelligent Agents» more  AAAI 1994»
    Solution Reuse in Dynamic Constraint Satisfaction Problems
    13 years 5 months ago
    Solution Reuse in Dynamic Constraint Satisfaction Problems
    Download  www.aaai.org
    Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
    Gérard Verfaillie, Thomas Schiex
    claim paper
    Read More »
    AAAI
    1994
    100views Intelligent Agents» more  AAAI 1994»
    Small is Beautiful: A Brute-Force Approach to Learning First-Order Formulas
    13 years 5 months ago
    Small is Beautiful: A Brute-Force Approach to Learning First-Order Formulas
    Download  www.aaai.org
    We describe a method for learning formulas in firstorder logic using a brute-force, smallest-first search. The method is exceedingly simple. It generates all irreducible well-form...
    Steven Minton, Ian Underwood
    claim paper
    Read More »
    AAAI
    1996
    101views Intelligent Agents» more  AAAI 1996»
    Agent Cooperation Can Compensate For Agent Ignorance in Constraint Satisfaction
    13 years 5 months ago
    Agent Cooperation Can Compensate For Agent Ignorance in Constraint Satisfaction
    Download  www.aaai.org
    A team of constraint agents with diverse viewpoints canfind a solution to a constraint satisfaction problem (CSP) whenthe individual agents have an incomplete viewof the problem.I...
    Peggy S. Eaton, Eugene C. Freuder
    claim paper
    Read More »
    AAAI
    1994
    97views Intelligent Agents» more  AAAI 1994»
    Dead-End Driven Learning
    13 years 5 months ago
    Dead-End Driven Learning
    Download  www.ics.uci.edu
    The paper evaluates the eectiveness of learning for speeding up the solution of constraint satisfaction problems. It extends previous work (Dechter 1990) by introducing a new and ...
    Daniel Frost, Rina Dechter
    claim paper
    Read More »
    AAAI
    1994
    134views Intelligent Agents» more  AAAI 1994»
    GENET: A Connectionist Architecture for Solving Constraint Satisfaction Problems by Iterative Improvement
    13 years 5 months ago
    GENET: A Connectionist Architecture for Solving Constraint Satisfaction Problems by Iterative Improvement
    Download  www.bracil.net
    New approaches to solving constraint satisfaction problems using iterative improvement techniques have been found to be successful on certain, very large problems such as the mill...
    Andrew J. Davenport, Edward P. K. Tsang, Chang J. ...
    claim paper
    Read More »
    AAAI
    2000
    129views Intelligent Agents» more  AAAI 2000»
    Asynchronous Search with Aggregations
    13 years 5 months ago
    Asynchronous Search with Aggregations
    Download  www.aaai.org
    Many problem-solving tasks can be formalized as constraint satisfaction problems (CSPs). In a multi-agent setting, information about constraints and variables may belong to differ...
    Marius-Calin Silaghi, Djamila Sam-Haroud, Boi Falt...
    claim paper
    Read More »
    AAAI
    1998
    136views Intelligent Agents» more  AAAI 1998»
    Extending GENET to Solve Fuzzy Constraint Satisfaction Problems
    13 years 5 months ago
    Extending GENET to Solve Fuzzy Constraint Satisfaction Problems
    Download  www.aaai.org
    Despite much research that has been done on constraint satisfaction problems (CSP's), the framework is sometimes inflexible and the results are not very satisfactory when app...
    Jason H. Y. Wong, Ho-Fung Leung
    claim paper
    Read More »
    IJCAI
    2003
    143views Artificial Intelligence» more  IJCAI 2003»
    Amalgams of Constraint Satisfaction Problems
    13 years 5 months ago
    Amalgams of Constraint Satisfaction Problems
    Download  dli.iiit.ac.in
    Many of standard practical techniques of solving constraint satisfaction problems use various decomposition methods to represent a problem as a combination of smaller ones. We stu...
    Andrei A. Bulatov, Evgeny S. Skvortsov
    claim paper
    Read More »
    « first‹ previous123456789…next ›last »
    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.