Sciweavers

    29908 search results - page 18 / 5982
    » On the complexity of communication complexity
    Sort
    View
    IROS
    2007
    IEEE
    149views Robotics» more  IROS 2007»
    A decentralized planner that guarantees the safety of communicating vehicles with complex dynamics that replan online
    14 years 2 months ago
    A decentralized planner that guarantees the safety of communicating vehicles with complex dynamics that replan online
    Download  www.kavrakilab.org
    — This paper considers the problem of coordinating multiple vehicles with kinodynamic constraints that operate in the same partially-known environment. The vehicles are able to c...
    Kostas E. Bekris, Konstantinos I. Tsianos, Lydia E...
    claim paper
    Read More »
    STOC
    2007
    ACM
    136views Algorithms» more  STOC 2007»
    Exponential separations for one-way quantum communication complexity, with applications to cryptography
    14 years 8 months ago
    Exponential separations for one-way quantum communication complexity, with applications to cryptography
    Download  homepages.cwi.nl
    We give an exponential separation between one-way quantum and classical communication protocols for two partial Boolean functions, both of which are variants of the Boolean Hidden...
    Dmitry Gavinsky, Julia Kempe, Iordanis Kerenidis, ...
    claim paper
    Read More »
    STOC
    2007
    ACM
    87views Algorithms» more  STOC 2007»
    The communication complexity of uncoupled nash equilibrium procedures
    14 years 8 months ago
    The communication complexity of uncoupled nash equilibrium procedures
    Download  www.cs.tau.ac.il
    Sergiu Hart, Yishay Mansour
    claim paper
    Read More »
    SOFSEM
    2009
    Springer
    90views Theoretical Computer Science» more  SOFSEM 2009»
    On Toda's Theorem in Structural Communication Complexity
    14 years 4 months ago
    On Toda's Theorem in Structural Communication Complexity
    Download  www.sofsem.cz
    Henning Wunderlich
    claim paper
    Read More »
    FOCS
    2008
    IEEE
    98views Theoretical Computer Science» more  FOCS 2008»
    The Unbounded-Error Communication Complexity of Symmetric Functions
    14 years 2 months ago
    The Unbounded-Error Communication Complexity of Symmetric Functions
    Download  userweb.cs.utexas.edu
    Alexander A. Sherstov
    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.