Sciweavers

    292 search results - page 56 / 59
    » Dormant program nodes and the efficiency of genetic programm...
    Sort
    View
    GECCO
    2007
    Springer
    194views Optimization» more  GECCO 2007»
    Hybrid coevolutionary algorithms vs. SVM algorithms
    14 years 1 months ago
    Hybrid coevolutionary algorithms vs. SVM algorithms
    Download  www.cs.bham.ac.uk
    As a learning method support vector machine is regarded as one of the best classifiers with a strong mathematical foundation. On the other hand, evolutionary computational techniq...
    Rui Li, Bir Bhanu, Krzysztof Krawiec
    claim paper
    Read More »
    BMCBI
    2006
    113views more  BMCBI 2006»
    QualitySNP: a pipeline for detecting single nucleotide polymorphisms and insertions/deletions in EST data from diploid and polyp
    13 years 7 months ago
    QualitySNP: a pipeline for detecting single nucleotide polymorphisms and insertions/deletions in EST data from diploid and polyp
    Download  www.biomedcentral.com
    Background: Single nucleotide polymorphisms (SNPs) are important tools in studying complex genetic traits and genome evolution. Computational strategies for SNP discovery make use...
    Jifeng Tang, Ben Vosman, Roeland E. Voorrips, C. G...
    claim paper
    Read More »
    ML
    2008
    ACM
    101views Machine Learning» more  ML 2008»
    On reoptimizing multi-class classifiers
    13 years 7 months ago
    On reoptimizing multi-class classifiers
    Download  cse.unl.edu
    Significant changes in the instance distribution or associated cost function of a learning problem require one to reoptimize a previously-learned classifier to work under new cond...
    Chris Bourke, Kun Deng, Stephen D. Scott, Robert E...
    claim paper
    Read More »
    TCS
    2008
    144views Theoretical Computer Science» more  TCS 2008»
    Algorithms for computing variants of the longest common subsequence problem
    13 years 7 months ago
    Algorithms for computing variants of the longest common subsequence problem
    Download  www.dcs.kcl.ac.uk
    The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
    Costas S. Iliopoulos, M. Sohel Rahman
    claim paper
    Read More »
    TVLSI
    2010
    345views Artificial Intelligence» more  TVLSI 2010»
    Improving Multi-Level NAND Flash Memory Storage Reliability Using Concatenated BCH-TCM Coding
    13 years 2 months ago
    Improving Multi-Level NAND Flash Memory Storage Reliability Using Concatenated BCH-TCM Coding
    Download  www.ecse.rpi.edu
    By storing more than one bit in each memory cell, multi-level per cell (MLC) NAND flash memories are dominating global flash memory market due to their appealing storage density ad...
    Shu Li, Tong 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.