Sciweavers

    2446 search results - page 352 / 490
    » Choiceless Polynomial Time
    Sort
    View
    IJCAI
    2003
    104views Artificial Intelligence» more  IJCAI 2003»
    A Maximal Tractable Class of Soft Constraints
    13 years 9 months ago
    A Maximal Tractable Class of Soft Constraints
    Download  dli.iiit.ac.in
    Many optimization problems can be expressed us­ ing some form of soft constraints, where different measures of desirability arc associated with differ­ ent combinations of domai...
    David A. Cohen, Martin C. Cooper, Peter Jeavons, A...
    claim paper
    Read More »
    IJCAI
    2003
    119views Artificial Intelligence» more  IJCAI 2003»
    Incremental Utility Elicitation with the Minimax Regret Decision Criterion
    13 years 9 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 »
    UAI
    2004
    95views Artificial Intelligence» more  UAI 2004»
    Computing Nash Equilibria of Action-Graph Games
    13 years 9 months ago
    Computing Nash Equilibria of Action-Graph Games
    Download  www.cs.ubc.ca
    Action-graph games (AGGs) are a fully expressive game representation which can compactly express both strict and context-specific independence between players' utility functi...
    Navin A. R. Bhat, Kevin Leyton-Brown
    claim paper
    Read More »
    AAAI
    2000
    82views Intelligent Agents» more  AAAI 2000»
    Divide-and-Conquer Frontier Search Applied to Optimal Sequence Alignment
    13 years 9 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 »
    NETWORKING
    2000
    116views Computer Networks» more  NETWORKING 2000»
    Spare Capacity Planning for Survivable Mesh Networks
    13 years 9 months ago
    Spare Capacity Planning for Survivable Mesh Networks
    Download  www.sis.pitt.edu
    Abstract. The design of survivable mesh based STM networks has received considerable attention in recent years and is a complex multiconstraint optimization problem. In this paper,...
    Adel Al-Rumaih, David Tipper, Yu Liu, Bryan A. Nor...
    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.