Sciweavers

    709 search results - page 84 / 142
    » On LR(k)-Parsers of Polynomial Size
    Sort
    View
    IJCAI
    2003
    119views Artificial Intelligence» more  IJCAI 2003»
    Incremental Utility Elicitation with the Minimax Regret Decision Criterion
    14 years 11 months ago
    Incremental Utility Elicitation with the Minimax Regret Decision Criterion
    Download  www.cs.toronto.edu
    Utility elicitation is a critical function of any automated decision aid, allowing decisions to be tailored to the preferences of a specific user. However, the size and complexit...
    Tianhan Wang, Craig Boutilier
    claim paper
    Read More »
    AAAI
    2000
    82views Intelligent Agents» more  AAAI 2000»
    Divide-and-Conquer Frontier Search Applied to Optimal Sequence Alignment
    14 years 11 months ago
    Divide-and-Conquer Frontier Search Applied to Optimal Sequence Alignment
    Download  www.aaai.org
    We present a new algorithm that reduces the space complexity of heuristic search. It is most effective for problem spaces that grow polynomially with problem size, but contain lar...
    Richard E. Korf, Weixiong Zhang
    claim paper
    Read More »
    AAAI
    1994
    111views Intelligent Agents» more  AAAI 1994»
    Tractable Planning with State Variables by Exploiting Structural Restrictions
    14 years 11 months ago
    Tractable Planning with State Variables by Exploiting Structural Restrictions
    Download  www.aaai.org
    So far, tractable planning problems reported in the literature have been defined by syntactical restrictions. To better exploit the inherent structure in problems, however, it is ...
    Peter Jonsson, Christer Bäckström
    claim paper
    Read More »
    IJCAI
    1989
    124views Artificial Intelligence» more  IJCAI 1989»
    An Algebraic Approach to Constraint Satisfaction Problems
    14 years 11 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 »
    AICOM
    2006
    124views more  AICOM 2006»
    A Compact Representation for Least Common Subsumers in the description logic ALE
    14 years 10 months ago
    A Compact Representation for Least Common Subsumers in the description logic ALE
    Download  www.inrialpes.fr
    This paper introduces a compact representation which helps to avoid the exponential blow-up in space of the Least Common Subsumer (lcs) of two ALEconcept descriptions. Based on th...
    Chan Le Duc, Nhan Le Thanh, Marie-Christine Rousse...
    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-2025, USA.