Sciweavers

    NETWORKS
    2008
    129views Computer Networks» more  NETWORKS 2008»
    Grooming for two-period optical networks
    13 years 8 months ago
    Grooming for two-period optical networks
    Download  www.dmi.unict.it
    Minimizing the number of add-drop multiplexers (ADMs) in a unidirectional SONET ring can be formulated as a graph decomposition problem. When traffic requirements are uniform and ...
    Charles J. Colbourn, Gaetano Quattrocchi, Violet R...
    claim paper
    Read More »
    NETWORKS
    2008
    108views Computer Networks» more  NETWORKS 2008»
    F-Chord: Improved uniform routing on Chord
    13 years 8 months ago
    F-Chord: Improved uniform routing on Chord
    Download  isis.dia.unisa.it
    Gennaro Cordasco, Luisa Gargano, Alberto Negro, Vi...
    claim paper
    Read More »
    NETWORKS
    2008
    142views Computer Networks» more  NETWORKS 2008»
    Approximation bounds for Black Hole Search problems
    13 years 8 months ago
    Approximation bounds for Black Hole Search problems
    Download  hal.archives-ouvertes.fr
    Ralf Klasing, Euripides Markou, Tomasz Radzik, Fab...
    claim paper
    Read More »
    NETWORKS
    2008
    208views Computer Networks» more  NETWORKS 2008»
    Competitive algorithms and lower bounds for online randomized call control in cellular networks
    13 years 8 months ago
    Competitive algorithms and lower bounds for online randomized call control in cellular networks
    Download  www.ceid.upatras.gr
    Ioannis Caragiannis, Christos Kaklamanis, Evi Papa...
    claim paper
    Read More »
    NETWORKS
    2008
    146views Computer Networks» more  NETWORKS 2008»
    Lower bounds for two-period grooming via linear programming duality
    13 years 8 months ago
    Lower bounds for two-period grooming via linear programming duality
    Download  www.dmi.unict.it
    In a problem arising in grooming for two-period optical networks, it is required to decompose the complete graph on n vertices into subgraphs each containing at most C edges, so t...
    Charles J. Colbourn, Gaetano Quattrocchi, Violet R...
    claim paper
    Read More »
    NETWORKS
    2008
    132views Computer Networks» more  NETWORKS 2008»
    Price competition with elastic traffic
    13 years 8 months ago
    Price competition with elastic traffic
    Download  web.mit.edu
    In this paper, we present a combined study of price competition and traffic control in a congested network. We study a model in which service providers own the routes in a network...
    Asuman E. Ozdaglar
    claim paper
    Read More »
    NETWORKS
    2008
    86views Computer Networks» more  NETWORKS 2008»
    A Reach and Bound algorithm for acyclic dynamic-programming networks
    13 years 8 months ago
    A Reach and Bound algorithm for acyclic dynamic-programming networks
    Download  www-personal.umich.edu
    Node pruning is a commonly used technique for solution acceleration in a dynamic programming network. In pruning, nodes are adaptively removed from the dynamic programming network...
    Matthew D. Bailey, Robert L. Smith, Jeffrey M. Ald...
    claim paper
    Read More »
    NETWORKS
    2008
    83views Computer Networks» more  NETWORKS 2008»
    The number of spanning trees in a class of double fixed-step loop networks
    13 years 8 months ago
    The number of spanning trees in a class of double fixed-step loop networks
    Download  www.cs.ust.hk
    In this paper, we develop a method to count the number of spanning trees in certain classes of double fixed-step loop networks with nonconstant steps. More specifically our techni...
    Xuerong Yong, Yuanping Zhang, Mordecai J. Golin
    claim paper
    Read More »
    NETWORKS
    2008
    115views Computer Networks» more  NETWORKS 2008»
    Spectral bounds for the maximum cut problem
    13 years 8 months ago
    Spectral bounds for the maximum cut problem
    Download  www.euro-online.org
    Walid Ben-Ameur, José Neto
    claim paper
    Read More »
    NETWORKS
    2008
    261views Computer Networks» more  NETWORKS 2008»
    The computational complexity of graph contractions II: Two tough polynomially solvable cases
    13 years 8 months ago
    The computational complexity of graph contractions II: Two tough polynomially solvable cases
    Download  www.win.tue.nl
    Asaf Levin, Daniël Paulusma, Gerhard J. Woegi...
    claim paper
    Read More »
    « first‹ previous…118119120121122123124125126…next ›last »
    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.