Sciweavers

    6167 search results - page 1233 / 1234
    » Can Refinement be Automated
    Sort
    View
    GECCO
    1999
    Springer
    111views Optimization» more  GECCO 1999»
    Evolving a behavior-based control architecture- From simulations to the real world
    13 years 9 months ago
    Evolving a behavior-based control architecture- From simulations to the real world
    Download  www.cs.bham.ac.uk
    Genetic programming makes it possible to automatically search the space of possible programs. First we evolved a behavior-based control architecture using computer simulations. Th...
    Marc Ebner, Andreas Zell
    claim paper
    Read More »
    BMCBI
    2005
    108views more  BMCBI 2005»
    A linear memory algorithm for Baum-Welch training
    13 years 5 months ago
    A linear memory algorithm for Baum-Welch training
    Download  www.biomedcentral.com
    Background: Baum-Welch training is an expectation-maximisation algorithm for training the emission and transition probabilities of hidden Markov models in a fully automated way. I...
    István Miklós, Irmtraud M. Meyer
    claim paper
    Read More »
    GIS
    2005
    ACM
    190views Automated Reasoning» more  GIS 2005»
    ASPEN: an adaptive spatial peer-to-peer network
    14 years 6 months ago
    ASPEN: an adaptive spatial peer-to-peer network
    Download  www-scf.usc.edu
    Geographic Information Systems (GIS) are increasingly managing very large sets of data and hence a centralized data repository may not always provide the most scalable solution. H...
    Haojun Wang, Roger Zimmermann, Wei-Shinn Ku
    claim paper
    Read More »
    PLDI
    2005
    ACM
    224views Programming Languages» more  PLDI 2005»
    Pin: building customized program analysis tools with dynamic instrumentation
    13 years 10 months ago
    Pin: building customized program analysis tools with dynamic instrumentation
    Download  www.cs.virginia.edu
    Robust and powerful software instrumentation tools are essential for program analysis tasks such as profiling, performance evaluation, and bug detection. To meet this need, we ha...
    Chi-Keung Luk, Robert S. Cohn, Robert Muth, Harish...
    claim paper
    Read More »
    IANDC
    2008
    141views more  IANDC 2008»
    Graph connectivity, partial words, and a theorem of Fine and Wilf
    13 years 5 months ago
    Graph connectivity, partial words, and a theorem of Fine and Wilf
    Download  www.uncg.edu
    The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...
    Francine Blanchet-Sadri, Deepak Bal, Gautam Sisodi...
    claim paper
    Read More »
    « Prev « First page 1233 / 1234 Last » Next »
    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.