Sciweavers

    1972 search results - page 68 / 395
    » connection 2008
    Sort
    View
    CCR
    2005
    96views more  CCR 2005»
    A protocol for packet network intercommunication
    13 years 8 months ago
    A protocol for packet network intercommunication
    Download  www.cs.princeton.edu
    -- A protocol that supports the sharing of resources that exist in different packet switching networks is presented. The protocol provides for variation in individual network packe...
    Vinton G. Cerf, Robert E. Kahn
    claim paper
    Read More »
    NETWORKS
    2008
    115views Computer Networks» more  NETWORKS 2008»
    A simple method for improving the primal simplex method for the multicommodity flow problem
    13 years 8 months ago
    A simple method for improving the primal simplex method for the multicommodity flow problem
    Download  jorlin.scripts.mit.edu
    We present a new efficient approach for solving the multicommodity flow problem as a sequence of subproblems, each on a very sparse but connected network. We show that each subpro...
    Agustín Bompadre, James B. Orlin
    claim paper
    Read More »
    SIAMDM
    2010
    128views more  SIAMDM 2010»
    t-Perfection Is Always Strong for Claw-Free Graphs
    13 years 7 months ago
    t-Perfection Is Always Strong for Claw-Free Graphs
    Download  www.dim.uchile.cl
    A connected graph G is called t-perfect if its stable set polytope is determined by the non-negativity, edge and odd-cycle inequalities. Moreover, G is called strongly t-perfect i...
    Henning Bruhn, Maya Stein
    claim paper
    Read More »
    IANDC
    2008
    101views more  IANDC 2008»
    Trees with exponentially growing costs
    13 years 8 months ago
    Trees with exponentially growing costs
    Download  www.cs.ust.hk
    We investigate code trees and search trees with cost functions that increase exponentially with the depth in the tree. While corresponding coding theorems have been considered in ...
    Frank Schulz
    claim paper
    Read More »
    DM
    2000
    99views more  DM 2000»
    Chromatically unique bipartite graphs with low 3-independent partition numbers
    13 years 8 months ago
    Chromatically unique bipartite graphs with low 3-independent partition numbers
    Download  math.nie.edu.sg
    For integers p; q; s with p
    Feng Ming Dong, Khee Meng Koh, Kee L. Teo, Charles...
    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.