Sciweavers

    858 search results - page 139 / 172
    » A Glimpse of Constraint Satisfaction
    Sort
    View
    FLAIRS
    2007
    86views Artificial Intelligence» more  FLAIRS 2007»
    Random Subsets Support Learning a Mixture of Heuristics
    13 years 10 months ago
    Random Subsets Support Learning a Mixture of Heuristics
    Download  www.aaai.org
    Problem solvers, both human and machine, have at their disposal many heuristics that may support effective search. The efficacy of these heuristics, however, varies with the probl...
    Smiljana Petrovic, Susan L. Epstein
    claim paper
    Read More »
    WSC
    2007
    164views Modeling And Simulation» more  WSC 2007»
    Agent-based simulations of service policy decisions
    13 years 10 months ago
    Agent-based simulations of service policy decisions
    Download  www.informs-sim.org
    During service engagements, project managers frequently encounter resource constraint issues. For each resource shortfall encountered, a project manager must decide among a narrow...
    Richard B. Lam
    claim paper
    Read More »
    IJCAI
    2003
    115views Artificial Intelligence» more  IJCAI 2003»
    Making the Breakout Algorithm Complete Using Systematic Search
    13 years 9 months ago
    Making the Breakout Algorithm Complete Using Systematic Search
    Download  liawww.epfl.ch
    Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to detect unso...
    Carlos Eisenberg, Boi Faltings
    claim paper
    Read More »
    AAAI
    1997
    130views Intelligent Agents» more  AAAI 1997»
    Using CSP Look-Back Techniques to Solve Real-World SAT Instances
    13 years 9 months ago
    Using CSP Look-Back Techniques to Solve Real-World SAT Instances
    Download  www.bayardo.org
    We report on the performance of an enhanced version of the “Davis-Putnam” (DP) proof procedure for propositional satisfiability (SAT) on large instances derived from realworld...
    Roberto J. Bayardo Jr., Robert Schrag
    claim paper
    Read More »
    AIPS
    1994
    136views Artificial Intelligence» more  AIPS 1994»
    A Framework for Automatic Problem Decomposition in Planning
    13 years 9 months ago
    A Framework for Automatic Problem Decomposition in Planning
    Download  www.cse.ust.hk
    An intelligent problem solver must be able to decompose a complex problem into simpler parts. A decomposition algorithm would not only be bene cial for traditional subgoal-oriente...
    Qiang Yang, Shuo Bai, Guiyou Qiu
    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.