Sciweavers

    540 search results - page 98 / 108
    » New bounds on the edge number of a k-map graph
    Sort
    View
    EOR
    2007
    104views more  EOR 2007»
    A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
    14 years 11 months ago
    A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
    Download  www.math.tu-dresden.de
    The two-dimensional orthogonal non-guillotine cutting problem (NGCP) appears in many industries (like wood and steel industries) and consists in cutting a rectangular master surfa...
    Roberto Baldacci, Marco A. Boschetti
    claim paper
    Read More »
    96
    Voted
    STOC
    2009
    ACM
    145views Algorithms» more  STOC 2009»
    Finding, minimizing, and counting weighted subgraphs
    16 years 11 days ago
    Finding, minimizing, and counting weighted subgraphs
    Download  www.math.ias.edu
    d Abstract] Virginia Vassilevska School of Mathematics Institute for Advanced Study Princeton, NJ 08540 USA virgi@math.ias.edu Ryan Williams School of Mathematics Institute for Adv...
    Virginia Vassilevska, Ryan Williams
    claim paper
    Read More »
    BROADNETS
    2005
    IEEE
    99views Computer Networks» more  BROADNETS 2005»
    Optimal path selection for ethernet over SONET under inaccurate link-state information
    15 years 5 months ago
    Optimal path selection for ethernet over SONET under inaccurate link-state information
    Download  www2.engr.arizona.edu
    — Ethernet over SONET (EoS) is a popular approach for interconnecting geographically distant Ethernet segments using a SONET transport infrastructure. It typically uses virtual c...
    Satyajeet Ahuja, Marwan Krunz, Turgay Korkmaz
    claim paper
    Read More »
    PODC
    2006
    ACM
    157views Distributed And Parallel Com...» more  PODC 2006»
    Local approximation schemes for topology control
    15 years 5 months ago
    Local approximation schemes for topology control
    Download  web.sau.edu
    This paper presents a distributed algorithm for wireless adhoc networks that runs in polylogarithmic number of rounds in the size of the network and constructs a lightweight, line...
    Mirela Damian, Saurav Pandit, Sriram V. Pemmaraju
    claim paper
    Read More »
    IJCGA
    2000
    64views more  IJCGA 2000»
    High Fidelity Interval Assignment
    14 years 11 months ago
    High Fidelity Interval Assignment
    Download  www.sandia.gov
    Quadrilateral meshing algorithms impose certain constraints on the number of intervals or mesh edges of the curves bounding a surface. When constructing a conformal mesh of a colle...
    Scott A. Mitchell
    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-2025, USA.