Sciweavers

    314 search results - page 9 / 63
    » A Constraint Based Agent for TAC-SCM
    Sort
    View
    AAAI
    2004
    116views Intelligent Agents» more  AAAI 2004»
    The Practice of Approximated Consistency for Knapsack Constraints
    13 years 8 months ago
    The Practice of Approximated Consistency for Knapsack Constraints
    Download  www.cs.brown.edu
    Knapsack constraints are a key modeling structure in discrete optimization and form the core of many real-life problem formulations. Only recently, a cost-based filtering algorith...
    Meinolf Sellmann
    claim paper
    Read More »
    SAC
    2004
    ACM
    116views Applied Computing» more  SAC 2004»
    A mobile agent approach for global database constraint checking
    14 years 23 days ago
    A mobile agent approach for global database constraint checking
    Download  tinman.cs.gsu.edu
    Integrity constraints are valuable tools for enforcing consistency of data in a database. Global integrity constraints ensure integrity and consistency of data spanning multiple d...
    Praveen Madiraju, Rajshekhar Sunderraman
    claim paper
    Read More »
    IAT
    2007
    IEEE
    100views Intelligent Agents» more  IAT 2007»
    Towards Constraint-Based Composition with Incomplete Service Descriptions
    14 years 1 months ago
    Towards Constraint-Based Composition with Incomplete Service Descriptions
    Download  www.vitvar.com
    We apply our work on Web service discovery with initially incomplete information to the problem of service composition. Rich semantic descriptions of Goals and Web services allow ...
    Matthew Moran, Tomas Vitvar, Maciej Zaremba
    claim paper
    Read More »
    AAAI
    2007
    96views Intelligent Agents» more  AAAI 2007»
    Synthesis of Constraint-Based Local Search Algorithms from High-Level Models
    13 years 9 months ago
    Synthesis of Constraint-Based Local Search Algorithms from High-Level Models
    Download  www.cs.brown.edu
    The gap in automation between MIP/SAT solvers and those for constraint programming and constraint-based local search hinders experimentation and adoption of these technologies and...
    Pascal Van Hentenryck, Laurent D. Michel
    claim paper
    Read More »
    AAAI
    2004
    93views Intelligent Agents» more  AAAI 2004»
    Branching and Pruning: An Optimal Temporal POCL Planner Based on Constraint Programming
    13 years 8 months ago
    Branching and Pruning: An Optimal Temporal POCL Planner Based on Constraint Programming
    Download  v.vidal.free.fr
    A key feature of modern optimal planners such as Graphplan and Blackbox is their ability to prune large parts of the search space. Previous Partial Order Causal Link (POCL) planne...
    Vincent Vidal, Hector Geffner
    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.