Sciweavers

    205 search results - page 7 / 41
    » Independent Additive Heuristics Reduce Search Multiplicative...
    Sort
    View
    GECCO
    2007
    Springer
    192views Optimization» more  GECCO 2007»
    Self-adaptive ant colony optimisation applied to function allocation in vehicle networks
    14 years 1 months ago
    Self-adaptive ant colony optimisation applied to function allocation in vehicle networks
    Download  www.cs.bham.ac.uk
    Modern vehicles possess an increasing number of software and hardware components that are integrated in electronic control units (ECUs). Finding an optimal allocation for all comp...
    Manuel Förster, Bettina Bickel, Bernd Hardung...
    claim paper
    Read More »
    BMCBI
    2008
    126views more  BMCBI 2008»
    c-REDUCE: Incorporating sequence conservation to detect motifs that correlate with expression
    13 years 7 months ago
    c-REDUCE: Incorporating sequence conservation to detect motifs that correlate with expression
    Download  www.biomedcentral.com
    Background: Computational methods for characterizing novel transcription factor binding sites search for sequence patterns or "motifs" that appear repeatedly in genomic ...
    Katerina Kechris, Hao Li
    claim paper
    Read More »
    BMCBI
    2008
    145views more  BMCBI 2008»
    Mapping gene expression quantitative trait loci by singular value decomposition and independent component analysis
    13 years 7 months ago
    Mapping gene expression quantitative trait loci by singular value decomposition and independent component analysis
    Download  www.biomedcentral.com
    Background: The combination of gene expression profiling with linkage analysis has become a powerful paradigm for mapping gene expression quantitative trait loci (eQTL). To date, ...
    Shameek Biswas, John D. Storey, Joshua M. Akey
    claim paper
    Read More »
    IPPS
    1997
    IEEE
    81views Distributed And Parallel Com...» more  IPPS 1997»
    A Parallel Tabu Search Algorithm For The 0-1 Multidimensional Knapsack Problem
    13 years 11 months ago
    A Parallel Tabu Search Algorithm For The 0-1 Multidimensional Knapsack Problem
    Download  ipdps.cc.gatech.edu
    The 0 1 MultidimensionalKnapsack Problem (0 1 MKP) is a NP-complete problem. Its resolution for large scale instances requires a prohibitive processing time. In this paper we prop...
    Smaïl Niar, Arnaud Fréville
    claim paper
    Read More »
    VTS
    2007
    IEEE
    203views Hardware» more  VTS 2007»
    Multiple Bit Upset Tolerant Memory Using a Selective Cycle Avoidance Based SEC-DED-DAEC Code
    14 years 1 months ago
    Multiple Bit Upset Tolerant Memory Using a Selective Cycle Avoidance Based SEC-DED-DAEC Code
    Download  users.ece.utexas.edu
    Conventional error correcting code (ECC) schemes used in memories and caches cannot correct double bit errors caused by a single event upset (SEU). As memory density increases, mu...
    Avijit Dutta, Nur A. Touba
    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.