Sciweavers

    1404 search results - page 241 / 281
    » Complexity of admissible rules
    Sort
    View
    AAAI
    2000
    97views Intelligent Agents» more  AAAI 2000»
    The Game of Hex: An Automatic Theorem Proving Approach to Game Programming
    13 years 10 months ago
    The Game of Hex: An Automatic Theorem Proving Approach to Game Programming
    Download  home.earthlink.net
    The game of Hex is a two-player game with simple rules, a deep underlying mathematical beauty, and a strategic complexity comparable to that of Chess and Go. The massive game-tree...
    Vadim V. Anshelevich
    claim paper
    Read More »
    BDA
    1997
    108views Knowledge Management» more  BDA 1997»
    A Non-Blocking Single-Phase Commit Protocol for Rigorous Participants
    13 years 10 months ago
    A Non-Blocking Single-Phase Commit Protocol for Rigorous Participants
    Download  www-smis.inria.fr
    Transactional standards have been promoted by OMG and X/Open to allow heterogeneous resources to participate in an Atomic Commitment Protocol (ACP), namely the two-phase commit pro...
    Maha Abdallah, Philippe Pucheral
    claim paper
    Read More »
    AIPT
    1993
    272views Information Technology» more  AIPT 1993»
    Automating the OSI to Internet Management Conversion Through the Use of an Object-Oriented Platform
    13 years 10 months ago
    Automating the OSI to Internet Management Conversion Through the Use of an Object-Oriented Platform
    Download  personal.ee.surrey.ac.uk
    OSI provides a powerful object-oriented management model that is infinitely scalable and extensible but is only now beginning to see widespread support. The Internet model has fo...
    George Pavlou, Saleem N. Bhatti, Graham Knight
    claim paper
    Read More »
    AIPS
    1996
    113views Artificial Intelligence» more  AIPS 1996»
    Modeling Probabilistic Actions for Practical Decision-Theoretic Planning
    13 years 10 months ago
    Modeling Probabilistic Actions for Practical Decision-Theoretic Planning
    Download  www.aaai.org
    Mostexisting decision-theoretic planners represent uncertainty about the state of the world with a precisely specified probability distribution over world states. This representat...
    AnHai Doan
    claim paper
    Read More »
    CCCG
    2009
    126views Computational Geometry» more  CCCG 2009»
    Enumeration of Polyominoes for p4 Tiling
    13 years 9 months ago
    Enumeration of Polyominoes for p4 Tiling
    Download  cccg.ca
    Polyominoes are the two dimensional shapes made by connecting n unit squares, joined along their edges. In this paper, we propose algorithms to enumerate polyominoes for p4 tiling...
    Takashi Horiyama, Masato Samejima
    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.