Sciweavers

    13621 search results - page 60 / 2725
    » Computability and Complexity in Self-assembly
    Sort
    View
    TJS
    2002
    101views more  TJS 2002»
    Compilation for Adaptive Computing Systems Using Complex Parameterized Hardware Objects
    15 years 3 months ago
    Compilation for Adaptive Computing Systems Using Complex Parameterized Hardware Objects
    Download  www.eis.cs.tu-bs.de
    FLAME, the Flexible API for Module-based Environments, is a proposed standard interface for the integration of parameterized hardware generators into high-level design tools. This ...
    Andreas Koch
    claim paper
    Read More »
    SAGT
    2010
    Springer
    191views Game Theory» more  SAGT 2010»
    The Computational Complexity of Trembling Hand Perfection and Other Equilibrium Refinements
    15 years 2 months ago
    The Computational Complexity of Trembling Hand Perfection and Other Equilibrium Refinements
    Download  www.daimi.au.dk
    Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, T...
    claim paper
    Read More »
    IJSYSC
    2011
    60views more  IJSYSC 2011»
    On necessary conditions for scale-freedom in complex networks, with applications to computer communication systems
    14 years 11 months ago
    On necessary conditions for scale-freedom in complex networks, with applications to computer communication systems
    Download  www.ece.ucsb.edu
    Wenjun Xiao, Weidong Chen, Behrooz Parhami
    claim paper
    Read More »
    SYNTHESE
    2011
    87views more  SYNTHESE 2011»
    Information theory, evolutionary computation, and Dembski's "complex specified information"
    14 years 11 months ago
    Information theory, evolutionary computation, and Dembski's "complex specified information"
    Download  www.talkreason.org
    Wesley R. Elsberry, Jeffrey Shallit
    claim paper
    Read More »
    CORR
    2012
    Springer
    183views Education» more  CORR 2012»
    Twisting q-holonomic sequences by complex roots of unity
    13 years 12 months ago
    Twisting q-holonomic sequences by complex roots of unity
    Download  www.risc.jku.at
    A sequence fn(q) is q-holonomic if it satisfies a nontrivial linear recurrence with coefficients polynomials in q and qn . Our main theorem states that q-holonomicity is preserve...
    Stavros Garoufalidis, Christoph Koutschan
    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.