Sciweavers

    2 search results - page 1 / 1
    » Fixed Parameter Polynomial Time Algorithms for Maximum Agree...
    Sort
    View
    CORR
    2008
    Springer
    92views Education» more  CORR 2008»
    Fixed Parameter Polynomial Time Algorithms for Maximum Agreement and Compatible Supertrees
    14 years 4 months ago
    Fixed Parameter Polynomial Time Algorithms for Maximum Agreement and Compatible Supertrees
    Download  drops.dagstuhl.de
    Consider a set of labels L and a set of trees T = {T (1) , T (2) , . . . , T (k) } where each tree T (i) is distinctly leaf-labeled by some subset of L. One fundamental problem is ...
    Viet Tung Hoang, Wing-Kin Sung
    claim paper
    Read More »
    CORR
    2010
    Springer
    182views Education» more  CORR 2010»
    Fast Convergence of Natural Bargaining Dynamics in Exchange Networks
    14 years 4 months ago
    Fast Convergence of Natural Bargaining Dynamics in Exchange Networks
    Download  research.microsoft.com
    Bargaining networks model the behavior of a set of players who need to reach pairwise agreements for making profits. Nash bargaining solutions in this context correspond to soluti...
    Yashodhan Kanoria, Mohsen Bayati, Christian Borgs,...
    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.