Sciweavers

    1589 search results - page 97 / 318
    » Constraints with Variables' Annotations
    Sort
    View
    CP
    2005
    Springer
    118views Artificial Intelligence» more  CP 2005»
    On Solving Soft Temporal Constraints Using SAT Techniques
    14 years 2 months ago
    On Solving Soft Temporal Constraints Using SAT Techniques
    Download  www.eecs.umich.edu
    In this paper, we present an algorithm for finding utilitarian optimal solutions to Simple and Disjunctive Temporal Problems with Preferences (STPPs and DTPPs) based on Benders’...
    Hossein M. Sheini, Bart Peintner, Karem A. Sakalla...
    claim paper
    Read More »
    CP
    2005
    Springer
    90views Artificial Intelligence» more  CP 2005»
    Robust Constraint Solving Using Multiple Heuristics
    14 years 2 months ago
    Robust Constraint Solving Using Multiple Heuristics
    Download  tidel.mie.utoronto.ca
    Abstract. Constraint Programming is a proven successful technique, but it requires skill in modeling problems, and knowledge on how algorithms interact with models. What can be a g...
    Alfio Vidotto, Kenneth N. Brown, J. Christopher Be...
    claim paper
    Read More »
    CSCLP
    2005
    Springer
    101views Artificial Intelligence» more  CSCLP 2005»
    A Hybrid Benders' Decomposition Method for Solving Stochastic Constraint Programs with Linear Recourse
    14 years 2 months ago
    A Hybrid Benders' Decomposition Method for Solving Stochastic Constraint Programs with Linear Recourse
    Download  www.cs.st-andrews.ac.uk
    Abstract. We adopt Benders’ decomposition algorithm to solve scenariobased Stochastic Constraint Programs (SCPs) with linear recourse. Rather than attempting to solve SCPs via a ...
    Armagan Tarim, Ian Miguel
    claim paper
    Read More »
    PPCP
    1993
    148views Programming Languages» more  PPCP 1993»
    Higher-Order Logic Programming as Constraint Logic Programming
    14 years 27 days ago
    Higher-Order Logic Programming as Constraint Logic Programming
    Download  www.cs.cmu.edu
    Higher-order logic programming (HOLP) languages are particularly useful for various kinds of metaprogramming and theorem proving tasks because of the logical support for variable ...
    Spiro Michaylov, Frank Pfenning
    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 10 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 »
    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.