Sciweavers

    7 search results - page 2 / 2
    » Improved Lower Bounds for Non-utilitarian Truthfulness
    Sort
    View
    LATIN
    2010
    Springer
    133views Information Technology» more  LATIN 2010»
    Randomized Truthful Algorithms for Scheduling Selfish Tasks on Parallel Machines
    14 years 11 months ago
    Randomized Truthful Algorithms for Scheduling Selfish Tasks on Parallel Machines
    Download  lethking.free.fr
    We study the problem of designing truthful algorithms for scheduling a set of tasks, each one owned by a selfish agent, to a set of parallel (identical or unrelated) machines in or...
    Eric Angel, Evripidis Bampis, Nicolas Thibault
    claim paper
    Read More »
    DLT
    2007
    80views Theoretical Computer Science» more  DLT 2007»
    Inapproximability of Nondeterministic State and Transition Complexity Assuming P=!NP
    14 years 11 months ago
    Inapproximability of Nondeterministic State and Transition Complexity Assuming P=!NP
    Download  www.informatik.uni-giessen.de
    Abstract. Inapproximability results concerning minimization of nondeterministic finite automata relative to given deterministic finite automata were obtained only recently, modul...
    Hermann Gruber, Markus Holzer
    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.