Sciweavers

    34 search results - page 4 / 7
    » On Miniaturized Problems in Parameterized Complexity Theory
    Sort
    View
    CEC
    2007
    IEEE
    139views Artificial Intelligence» more  CEC 2007»
    Target shape design optimization by evolving splines
    14 years 1 months ago
    Target shape design optimization by evolving splines
    Download  www.cs.bham.ac.uk
    Abstract— Target shape design optimization problem (TSDOP) is a miniature model for real world design optimization problems. It is proposed as a test bed to design and analyze op...
    Pan Zhang, Xin Yao, Lei Jia, Bernhard Sendhoff, Th...
    claim paper
    Read More »
    EOR
    2008
    136views more  EOR 2008»
    Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs
    13 years 7 months ago
    Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs
    Download  theinf1.informatik.uni-jena.de
    Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...
    Jiong Guo, Falk Hüffner, Erhan Kenar, Rolf Ni...
    claim paper
    Read More »
    MST
    2006
    149views more  MST 2006»
    Parameterized Intractability of Distinguishing Substring Selection
    13 years 7 months ago
    Parameterized Intractability of Distinguishing Substring Selection
    Download  theinf1.informatik.uni-jena.de
    A central question in computational biology is the design of genetic markers to distinguish between two given sets of (DNA) sequences. This question is formalized as the NP-comple...
    Jens Gramm, Jiong Guo, Rolf Niedermeier
    claim paper
    Read More »
    FCT
    2003
    Springer
    127views Applied Computing» more  FCT 2003»
    On Exact and Approximation Algorithms for Distinguishing Substring Selection
    14 years 22 days ago
    On Exact and Approximation Algorithms for Distinguishing Substring Selection
    Download  theinf1.informatik.uni-jena.de
    Abstract. The NP-complete Distinguishing Substring Selection problem (DSSS for short) asks, given a set of “good” strings and a set of “bad” strings, for a solution string ...
    Jens Gramm, Jiong Guo, Rolf Niedermeier
    claim paper
    Read More »
    CIE
    2007
    Springer
    161views Applied Computing» more  CIE 2007»
    The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number
    14 years 1 months ago
    The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number
    Download  www.ii.uib.no
    In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
    Michael R. Fellows, Frances A. Rosamond
    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.