Sciweavers

    728 search results - page 116 / 146
    » Compressing combinatorial objects
    Sort
    View
    INFORMATICALT
    2010
    101views more  INFORMATICALT 2010»
    An Improved Differential Evolution Scheme for the Solution of Large-Scale Unit Commitment Problems
    13 years 8 months ago
    An Improved Differential Evolution Scheme for the Solution of Large-Scale Unit Commitment Problems
    Download  www.mii.lt
    This paper presents an improved differential evolution (IDE) method for the solution of large-scale unit commitment (UC) problems. The objective of the proposed scheme is to determ...
    Chen-Sung Chang
    claim paper
    Read More »
    TCS
    2010
    133views Theoretical Computer Science» more  TCS 2010»
    Maximum likelihood analysis of algorithms and data structures
    13 years 8 months ago
    Maximum likelihood analysis of algorithms and data structures
    Download  wwwagak.informatik.uni-kl.de
    We present a new approach for an average-case analysis of algorithms and data structures that supports a non-uniform distribution of the inputs and is based on the maximum likelih...
    Ulrich Laube, Markus E. Nebel
    claim paper
    Read More »
    VC
    2010
    160views more  VC 2010»
    A lightweight approach to repairing digitized polygon meshes
    13 years 8 months ago
    A lightweight approach to repairing digitized polygon meshes
    Download  www.ima.ge.cnr.it
    Abstract When designing novel algorithms for geometric processing and analysis, researchers often assume that the input conforms to several requirements. On the other hand, polygon...
    Marco Attene
    claim paper
    Read More »
    TCS
    2010
    126views Theoretical Computer Science» more  TCS 2010»
    An optimal algorithm to generate rooted trivalent diagrams and rooted triangular maps
    13 years 4 months ago
    An optimal algorithm to generate rooted trivalent diagrams and rooted triangular maps
    Download  samuel.math.online.fr
    Abstract. A trivalent diagram is a connected, two-colored bipartite graph (parallel edges allowed but not loops) such that every black vertex is of degree 1 or 3 and every white ve...
    Samuel Alexandre Vidal
    claim paper
    Read More »
    IPL
    2011
    96views more  IPL 2011»
    Restricted compositions and permutations: From old to new Gray codes
    13 years 4 months ago
    Restricted compositions and permutations: From old to new Gray codes
    Download  v.vincent.u-bourgogne.fr
    Any Gray code for a set of combinatorial objects defines a total order relation on this set: x is less than y if and only if y occurs after x in the Gray code list. Let ≺ denot...
    Vincent Vajnovszki, Rémi Vernay
    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.