Sciweavers

    4218 search results - page 193 / 844
    » Complete sets of cooperations
    Sort
    View
    ICNC
    2005
    Springer
    117views Applied Computing» more  ICNC 2005»
    On the Categorizing of Simply Separable Relations in Partial Four-Valued Logic
    14 years 4 months ago
    On the Categorizing of Simply Separable Relations in Partial Four-Valued Logic
    Download  cie.xtu.edu.cn
    In completeness theories of multiple-valued logic, the characterization of Sheffer functions is an important problem，and the solution can be reduced to determining the minimal co...
    Renren Liu, Zhiwei Gong, Fen Xu
    claim paper
    Read More »
    LPNMR
    2005
    Springer
    99views Automated Reasoning» more  LPNMR 2005»
    SELP - A System for Studying Strong Equivalence Between Logic Programs
    14 years 4 months ago
    SELP - A System for Studying Strong Equivalence Between Logic Programs
    Download  ftp.informatik.rwth-aachen.de
    Abstract. This paper describes a system called SELP for studying strong equivalence in answer set logic programming. The basic function of the system is to check if two given groun...
    Yin Chen, Fangzhen Lin, Lei Li
    claim paper
    Read More »
    4OR
    2005
    71views more  4OR 2005»
    On rank-perfect subclasses of near-bipartite graphs
    13 years 10 months ago
    On rank-perfect subclasses of near-bipartite graphs
    Download  www.math.uni-magdeburg.de
    Shepherd (1995) proved that the stable set polytopes of near-bipartite graphs are given by constraints associated with the complete join of antiwebs only. For antiwebs, the facet s...
    Annegret Wagler
    claim paper
    Read More »
    ACSC
    2007
    IEEE
    107views Theoretical Computer Science» more  ACSC 2007»
    Improved Shortest Path Algorithms For Nearly Acyclic Directed Graphs
    14 years 5 months ago
    Improved Shortest Path Algorithms For Nearly Acyclic Directed Graphs
    Download  crpit.com
    This paper presents new algorithms for computing single source shortest paths (SSSPs) in a nearly acyclic directed graph G. The first part introduces higher-order decomposition. ...
    Lin Tian, Tadao Takaoka
    claim paper
    Read More »
    AP2PC
    2007
    Springer
    278views Intelligent Agents» more  AP2PC 2007»
    Enabling Grassroots Distributed Computing with CompTorrent
    14 years 9 days ago
    Enabling Grassroots Distributed Computing with CompTorrent
    Download  eprints.utas.edu.au
    This paper describes the operational characteristics of “CompTorrent”, a general purpose distributed computing platform that provides a low entry cost to creating new distribut...
    Bradley Goldsmith
    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.