Sciweavers

    3875 search results - page 84 / 775
    » Approximation Algorithms for the Max-coloring Problem
    Sort
    View
    IPL
    2008
    95views more  IPL 2008»
    The Generalized Maximum Coverage Problem
    13 years 8 months ago
    The Generalized Maximum Coverage Problem
    Download  www.cs.technion.ac.il
    We define a new problem called the Generalized Maximum Coverage Problem (GMC). GMC is an extension of the Budgeted Maximum Coverage Problem, and it has important applications in w...
    Reuven Cohen, Liran Katzir
    claim paper
    Read More »
    IPL
    2007
    94views more  IPL 2007»
    The finite horizon investor problem with a budget constraint
    13 years 8 months ago
    The finite horizon investor problem with a budget constraint
    Download  pluto.mscc.huji.ac.il
    We study a model that incorporates a budget constraint in a decision making problem. Our goal is to maximize the expected wealth, where in each time period we can either stop the ...
    Asaf Levin
    claim paper
    Read More »
    TALG
    2010
    86views more  TALG 2010»
    Approximating corridors and tours via restriction and relaxation techniques
    13 years 7 months ago
    Approximating corridors and tours via restriction and relaxation techniques
    Download  www.cs.ucsb.edu
    Given a rectangular boundary partitioned into rectangles, the Minimum-Length Corridor (MLC-R) problem consists of finding a corridor of least total length. A corridor is a set of ...
    Arturo Gonzalez-Gutierrez, Teofilo F. Gonzalez
    claim paper
    Read More »
    STOC
    2005
    ACM
    111views Algorithms» more  STOC 2005»
    Tensor decomposition and approximation schemes for constraint satisfaction problems
    14 years 9 months ago
    Tensor decomposition and approximation schemes for constraint satisfaction problems
    Download  www-math.mit.edu
    Wenceslas Fernandez de la Vega, Marek Karpinski, R...
    claim paper
    Read More »
    BMCBI
    2006
    100views more  BMCBI 2006»
    Towards a better solution to the shortest common supersequence problem: the deposition and reduction algorithm
    13 years 9 months ago
    Towards a better solution to the shortest common supersequence problem: the deposition and reduction algorithm
    Download  www.biomedcentral.com
    Background: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biol...
    Kang Ning, Hon Wai Leong
    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.