Sciweavers

    350 search results - page 8 / 70
    » Supporting the specification and analysis of timing constrai...
    Sort
    View
    BMCBI
    2007
    162views more  BMCBI 2007»
    Genome-wide identification of specific oligonucleotides using artificial neural network and computational genomic analysis
    13 years 7 months ago
    Genome-wide identification of specific oligonucleotides using artificial neural network and computational genomic analysis
    Download  www.biomedcentral.com
    Background: Genome-wide identification of specific oligonucleotides (oligos) is a computationallyintensive task and is a requirement for designing microarray probes, primers, and ...
    Chun-Chi Liu, Chin-Chung Lin, Ker-Chau Li, Wen-Shy...
    claim paper
    Read More »
    ICCAD
    1999
    IEEE
    125views Hardware» more  ICCAD 1999»
    Direct synthesis of timed asynchronous circuits
    13 years 11 months ago
    Direct synthesis of timed asynchronous circuits
    Download  www.async.ece.utah.edu
    This paper presents a new method to synthesize timed asynchronous circuits directly from the specification without generating a state graph. The synthesis procedure begins with a ...
    Sung Tae Jung, Chris J. Myers
    claim paper
    Read More »
    SCCC
    1998
    IEEE
    139views Theoretical Computer Science» more  SCCC 1998»
    An Adaptive Model for Programming Distributed Real-Time Applications in CORBA
    13 years 11 months ago
    An Adaptive Model for Programming Distributed Real-Time Applications in CORBA
    Download  www.das.ufsc.br
    CORBA is a middleware with open standardization that is receiving plenty of acceptance for facilitating the distributed objects programming. CORBA is being extended through the sp...
    Carlos Montez, Rômulo Silva de Oliveira, Jon...
    claim paper
    Read More »
    WCET
    2008
    78views Software Engineering» more  WCET 2008»
    Computing time as a program variable: a way around infeasible paths
    13 years 8 months ago
    Computing time as a program variable: a way around infeasible paths
    Download  www.bound-t.com
    Conditional branches connect the values of program variables with the execution paths and thus with the execution times, including the worstcase execution time (WCET). Flow analys...
    Niklas Holsti
    claim paper
    Read More »
    DAC
    2006
    ACM
    150views Computer Architecture» more  DAC 2006»
    An efficient and versatile scheduling algorithm based on SDC formulation
    14 years 8 months ago
    An efficient and versatile scheduling algorithm based on SDC formulation
    Download  cadlab.cs.ucla.edu
    Scheduling plays a central role in the behavioral synthesis process, which automatically compiles high-level specifications into optimized hardware implementations. However, most ...
    Jason Cong, Zhiru Zhang
    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.