Sciweavers

    13603 search results - page 47 / 2721
    » On the Computational Complexity of Cut-Reduction
    Sort
    View
    COMCOM
    2011
    189views Computational Linguistics» more  COMCOM 2011»
    Second order centrality: Distributed assessment of nodes criticity in complex networks
    14 years 4 months ago
    Second order centrality: Distributed assessment of nodes criticity in complex networks
    Download  www.thlab.net
    Anne-Marie Kermarrec, Erwan Le Merrer, Bruno Seric...
    claim paper
    Read More »
    SAC
    2010
    ACM
    114views Applied Computing» more  SAC 2010»
    Improving complex distributed software system availability through information hiding
    14 years 4 months ago
    Improving complex distributed software system availability through information hiding
    Download  www.dtic.mil
    Li Wang, Yair Leiferman, Shangping Ren, Kevin A. K...
    claim paper
    Read More »
    PODC
    2012
    ACM
    215views Distributed and Parallel Com...» more  PODC 2012»
    The communication complexity of distributed task allocation
    13 years 6 days ago
    The communication complexity of distributed task allocation
    Download  ac.informatik.uni-freiburg.de
    Andrew Drucker, Fabian Kuhn, Rotem Oshman
    claim paper
    Read More »
    MCU
    2007
    95views Hardware» more  MCU 2007»
    Slightly Beyond Turing's Computability for Studying Genetic Programming
    14 years 11 months ago
    Slightly Beyond Turing's Computability for Studying Genetic Programming
    Download  eprints.pascal-network.org
    Inspired by genetic programming (GP), we study iterative algorithms for non-computable tasks and compare them to naive models. This framework justifies many practical standard tri...
    Olivier Teytaud
    claim paper
    Read More »
    ACMSE
    2006
    ACM
    100views Theoretical Computer Science» more  ACMSE 2006»
    Revisiting a limit on efficient quantum computation
    15 years 1 months ago
    Revisiting a limit on efficient quantum computation
    Download  www.physast.uga.edu
    In this paper, we offer an exposition of a theorem originally due to Adleman, Demarrais and Huang that shows that the quantum complexity class BQP (Bounded-error Quantum Polynomia...
    Tarsem S. Purewal Jr.
    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.