Sciweavers

    1657 search results - page 16 / 332
    » Network flow spanners
    Sort
    View
    NETWORKS
    2007
    73views Computer Networks» more  NETWORKS 2007»
    Heuristic solutions for general concave minimum cost network flow problems
    13 years 9 months ago
    Heuristic solutions for general concave minimum cost network flow problems
    Download  www.fep.up.pt
    Dalila B. M. M. Fontes, José Fernando Gon&c...
    claim paper
    Read More »
    NETWORKS
    2008
    127views Computer Networks» more  NETWORKS 2008»
    Cycle-based algorithms for multicommodity network flow problems with separable piecewise convex costs
    13 years 9 months ago
    Cycle-based algorithms for multicommodity network flow problems with separable piecewise convex costs
    Download  www.isima.fr
    Maurício C. de Souza, Philippe Mahey, Berna...
    claim paper
    Read More »
    APNOMS
    2007
    Springer
    179views Computer Networks» more  APNOMS 2007»
    End-to-End Flow Monitoring with IPFIX
    14 years 1 months ago
    End-to-End Flow Monitoring with IPFIX
    Download  networks.cnu.ac.kr
    End-to-End (E2E) flow monitoring is useful for observing performance of networks such as throughput, loss rate, and jitter. Typically, E2E flow monitoring is carried out at end hos...
    Byungjoon Lee, Hyeongu Son, Seunghyun Yoon, Youngs...
    claim paper
    Read More »
    FMCAD
    2007
    Springer
    149views Formal Methods» more  FMCAD 2007»
    Fast Minimum-Register Retiming via Binary Maximum-Flow
    14 years 4 months ago
    Fast Minimum-Register Retiming via Binary Maximum-Flow
    Download  www.eecs.berkeley.edu
    We present a formulation of retiming to minimize the number of registers in a design by iterating a maximum network flow problem. The retiming returned will be the optimum one whi...
    Aaron P. Hurst, Alan Mishchenko, Robert K. Brayton
    claim paper
    Read More »
    ICNP
    1996
    IEEE
    89views Computer Networks» more  ICNP 1996»
    Time-Shift Scheduling: Fair Scheduling of Flows in High Speed Networks
    14 years 2 months ago
    Time-Shift Scheduling: Fair Scheduling of Flows in High Speed Networks
    Download  www.utdallas.edu
    Abstract-- We present a scheduling protocol, called TimeShift Scheduling, to forward packets from multiple input flows to a single output channel. Each input flow is guaranteed a p...
    Jorge Arturo Cobb, Mohamed G. Gouda, Amal El-Nahas
    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.