Sciweavers

    17 search results - page 1 / 4
    » Using Three States for Binary Consensus on Complete Graphs
    Sort
    View
    INFOCOM
    2009
    IEEE
    147views Communications» more  INFOCOM 2009»
    Using Three States for Binary Consensus on Complete Graphs
    14 years 5 days ago
    Using Three States for Binary Consensus on Complete Graphs
    Download  research.microsoft.com
    Etienne Perron, Dinkar Vasudevan, Milan Vojnovic
    claim paper
    Read More »
    SIROCCO
    2010
    148views Information Technology» more  SIROCCO 2010»
    Average Long-Lived Memoryless Consensus: The Three-Value Case
    13 years 7 months ago
    Average Long-Lived Memoryless Consensus: The Three-Value Case
    Download  www.dim.uchile.cl
    Abstract. We study strategies that minimize the instability of a faulttolerant consensus system. More precisely, we find the strategy than minimizes the number of output changes ov...
    Ivan Rapaport, Eric Rémila
    claim paper
    Read More »
    AIPS
    2007
    63views Artificial Intelligence» more  AIPS 2007»
    On the Hardness of Planning Problems with Simple Causal Graphs
    13 years 7 months ago
    On the Hardness of Planning Problems with Simple Causal Graphs
    Download  www.dtic.upf.edu
    We present three new complexity results for classes of planning problems with simple causal graphs. First, we describe a polynomial time algorithm that uses macros to generate pla...
    Omer Giménez, Anders Jonsson
    claim paper
    Read More »
    JAIR
    2008
    99views more  JAIR 2008»
    The Complexity of Planning Problems With Simple Causal Graphs
    13 years 5 months ago
    The Complexity of Planning Problems With Simple Causal Graphs
    Download  www.aaai.org
    We present three new complexity results for classes of planning problems with simple causal graphs. First, we describe a polynomial-time algorithm that uses macros to generate pla...
    Omer Giménez, Anders Jonsson
    claim paper
    Read More »
    JAPLL
    2006
    114views more  JAPLL 2006»
    The monadic second-order logic of graphs XV: On a conjecture by D. Seese
    13 years 5 months ago
    The monadic second-order logic of graphs XV: On a conjecture by D. Seese
    Download  www.labri.fr
    A conjecture by D. Seese states that if a set of graphs has a decidable monadic second-order theory, then it is the image of a set of trees under a transformation defined by monad...
    Bruno Courcelle
    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.