Sciweavers

    13603 search results - page 22 / 2721
    » On the computational complexity of bridgecard
    Sort
    View
    CSR
    2007
    Springer
    89views Theoretical Computer Science» more  CSR 2007»
    Recent development in computational complexity characterization of Nash equilibrium
    15 years 6 months ago
    Recent development in computational complexity characterization of Nash equilibrium
    Download  www.elsevier.com
    Xi Chen, Xiaotie Deng
    claim paper
    Read More »
    COLING
    1999
    221views Computational Linguistics» more  COLING 1999»
    The Computational Complexity of the Correct-Prefix Property for TAGs
    15 years 6 months ago
    The Computational Complexity of the Correct-Prefix Property for TAGs
    Download  www.aclweb.org
    Mark-Jan Nederhof
    claim paper
    Read More »
    ACL
    2011
    233views Computational Linguistics» more  ACL 2011»
    Computing and Evaluating Syntactic Complexity Features for Automated Scoring of Spontaneous Non-Native Speech
    14 years 10 months ago
    Computing and Evaluating Syntactic Complexity Features for Automated Scoring of Spontaneous Non-Native Speech
    Download  www.aclweb.org
    Miao Chen, Klaus Zechner
    claim paper
    Read More »
    CIE
    2007
    Springer
    127views Applied Computing» more  CIE 2007»
    Computational Complexity of Constraint Satisfaction
    16 years 1 months ago
    Computational Complexity of Constraint Satisfaction
    Download  www.thi.uni-hannover.de
    Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
    Heribert Vollmer
    claim paper
    Read More »
    STOC
    1993
    ACM
    141views Algorithms» more  STOC 1993»
    Bounds for the computational power and learning complexity of analog neural nets
    15 years 11 months ago
    Bounds for the computational power and learning complexity of analog neural nets
    Download  www.igi.tugraz.at
    Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
    Wolfgang Maass
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.