Sciweavers

    12265 search results - page 3 / 2453
    » Knuth-Morris-Pratt Algorithm: An Analysis
    Sort
    View
    DOCENG
    2011
    ACM
    274views Document Analysis» more  DOCENG 2011»
    Citation pattern matching algorithms for citation-based plagiarism detection: greedy citation tiling, citation chunking and long
    12 years 7 months ago
    Citation pattern matching algorithms for citation-based plagiarism detection: greedy citation tiling, citation chunking and long
    Download  www.sciplore.org
    Bela Gipp, Norman Meuschke
    claim paper
    Read More »
    JMLR
    2010
    194views more  JMLR 2010»
    A Statistical Implicative Analysis Based Algorithm and MMPC Algorithm for Detecting Multiple Dependencies
    13 years 2 months ago
    A Statistical Implicative Analysis Based Algorithm and MMPC Algorithm for Detecting Multiple Dependencies
    Download  jmlr.csail.mit.edu
    Discovering the dependencies among the variables of a domain from examples is an important problem in optimization. Many methods have been proposed for this purpose, but few large...
    Elham Salehi, Jayashree Nyayachavadi, Robin Gras
    claim paper
    Read More »
    15
    Voted
    CJ
    2010
    100views more  CJ 2010»
    Handbook of Approximation Algorithms and Metaheuristics
    13 years 4 months ago
    Handbook of Approximation Algorithms and Metaheuristics
    Download  www.cs.ucsb.edu
    Jakub Marecek
    claim paper
    Read More »
    GECCO
    2009
    Springer
    133views Optimization» more  GECCO 2009»
    Improved analysis methods for crossover-based algorithms
    13 years 5 months ago
    Improved analysis methods for crossover-based algorithms
    Download  www.math.tu-berlin.de
    We deepen the theoretical analysis of the genetic algorithm for the all-pairs shortest path problem proposed by Doerr, Happ and Klein (GECCO 2008). We show that the growth of the ...
    Benjamin Doerr, Madeleine Theile
    claim paper
    Read More »
    LADC
    2011
    Springer
    267views Applied Computing» more  LADC 2011»
    Timing Analysis of Leader-Based and Decentralized Byzantine Consensus Algorithms
    12 years 10 months ago
    Timing Analysis of Leader-Based and Decentralized Byzantine Consensus Algorithms
    Download  infoscience.epfl.ch
    —We compare in an analytical way two leader-based and decentralized algorithms (that is, algorithms that do not use a leader) for Byzantine consensus with strong validity. We sho...
    Fatemeh Borran, Martin Hutle, André Schiper
    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.