Sciweavers

    760 search results - page 62 / 152
    » Algorithms for finding clique-transversals of graphs
    Sort
    View
    ICGA
    1993
    296views Optimization» more  ICGA 1993»
    A Genetic Algorithm Applied to the Maximum Flow Problem
    13 years 10 months ago
    A Genetic Algorithm Applied to the Maximum Flow Problem
    Download  cis.csuohio.edu
    A genetic algorithms is applied to find a maximum flow from the source to sink in a weighted directed graph, where the weight associated with each edge represents its flow capacit...
    Toshinori Munakata, David J. Hashier
    claim paper
    Read More »
    CSB
    2003
    IEEE
    108views Bioinformatics» more  CSB 2003»
    A Pattern Matching Algorithm for Codon Optimization and CpG Motif-Engineering in DNA Expression Vectors
    14 years 2 months ago
    A Pattern Matching Algorithm for Codon Optimization and CpG Motif-Engineering in DNA Expression Vectors
    Download  conferences.computer.org
    Codon optimization enhances the efficiency of DNA expression vectors used in DNA vaccination and gene therapy by increasing protein expression. Additionally, certain nucleotide mo...
    Ravi Vijaya Satya, Amar Mukherjee, Udaykumar Ranga
    claim paper
    Read More »
    ACID
    2006
    220views Algorithms» more  ACID 2006»
    Vertex and Edge Covers with Clustering Properties: Complexity and Algorithms
    13 years 10 months ago
    Vertex and Edge Covers with Clustering Properties: Complexity and Algorithms
    Download  www.dcs.gla.ac.uk
    We consider the concepts of a t-total vertex cover and a t-total edge cover (t 1), which generalize the notions of a vertex cover and an edge cover, respectively. A t-total verte...
    Henning Fernau, David Manlove
    claim paper
    Read More »
    TCS
    2008
    152views Theoretical Computer Science» more  TCS 2008»
    Approximation algorithms for partially covering with edges
    13 years 8 months ago
    Approximation algorithms for partially covering with edges
    Download  www.mathcs.emory.edu
    The edge dominating set (EDS) and edge cover (EC) problems are classical graph covering problems in which one seeks a minimum cost collection of edges which covers the edges or ve...
    Ojas Parekh
    claim paper
    Read More »
    TCS
    2008
    118views Theoretical Computer Science» more  TCS 2008»
    Distance- k knowledge in self-stabilizing algorithms
    13 years 8 months ago
    Distance- k knowledge in self-stabilizing algorithms
    Download  www.cs.clemson.edu
    Abstract. Many graph problems seem to require knowledge that extends beyond the immediate neighbors of a node. The usual self-stabilizing model only allows for nodes to make decisi...
    Wayne Goddard, Stephen T. Hedetniemi, David Pokras...
    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.