Sciweavers

    NETWORKS
    2010
    123views Computer Networks» more  NETWORKS 2010»
    An ejection chain algorithm for the quadratic assignment problem
    13 years 5 months ago
    An ejection chain algorithm for the quadratic assignment problem
    Download  faculty.bus.olemiss.edu
    César Rego, Tabitha James, Fred Glover
    claim paper
    Read More »
    NETWORKS
    2010
    139views Computer Networks» more  NETWORKS 2010»
    Gossiping and routing in undirected triple-loop networks
    13 years 5 months ago
    Gossiping and routing in undirected triple-loop networks
    Download  www.ms.unimelb.edu.au
    Alison Thomson, Sanming Zhou
    claim paper
    Read More »
    NETWORKS
    2010
    115views Computer Networks» more  NETWORKS 2010»
    Optimal routing with failure-independent path protection
    13 years 5 months ago
    Optimal routing with failure-independent path protection
    Download  www.syssec.ethz.ch
    Thomas Stidsen, Bjørn Petersen, Simon Spoor...
    claim paper
    Read More »
    NETWORKS
    2010
    132views Computer Networks» more  NETWORKS 2010»
    Network flow spanners
    13 years 9 months ago
    Network flow spanners
    Download  www.cs.kent.edu
    Abstract. In this paper, motivated by applications of ordinary (distance) spanners in communication networks and to address such issues as bandwidth constraints on network links, l...
    Feodor F. Dragan, Chenyu Yan
    claim paper
    Read More »
    NETWORKS
    2010
    155views Computer Networks» more  NETWORKS 2010»
    Complexity of some inverse shortest path lengths problems
    13 years 9 months ago
    Complexity of some inverse shortest path lengths problems
    Download  ieor.berkeley.edu
    The input to an Inverse Shortest Path Lengths Problem (ISPL) consists of a graph G with arc weights, and a collection of source-sink pairs with prescribed distances that do not ne...
    Tingting Cui, Dorit S. Hochbaum
    claim paper
    Read More »
    NETWORKS
    2010
    153views Computer Networks» more  NETWORKS 2010»
    A mean-variance model for the minimum cost flow problem with stochastic arc costs
    13 years 9 months ago
    A mean-variance model for the minimum cost flow problem with stochastic arc costs
    Download  transnet1.ce.utexas.edu
    This paper considers a minimum cost flow problem where arc costs are uncertain, and the decision maker wishes to minimize both the expected flow cost and the variance of this co...
    Stephen D. Boyles, S. Travis Waller
    claim paper
    Read More »
    NETWORKS
    2010
    135views Computer Networks» more  NETWORKS 2010»
    Probabilistic models for the Steiner Tree problem
    13 years 9 months ago
    Probabilistic models for the Steiner Tree problem
    Download  www-sop.inria.fr
    We consider a probabilistic model for the Steiner Tree problem. Under this model the problem is defined in a 2-stage setting over a first-stage complete weighted graph having it...
    Vangelis Th. Paschos, Orestis Telelis, Vassilis Zi...
    claim paper
    Read More »
    NETWORKS
    2010
    126views Computer Networks» more  NETWORKS 2010»
    Simultaneous embeddings of graphs as median and antimedian subgraphs
    13 years 9 months ago
    Simultaneous embeddings of graphs as median and antimedian subgraphs
    Download  www-mat.pfmb.uni-mb.si
    Kannan Balakrishnan, Bostjan Bresar, Matjaz Kovse,...
    claim paper
    Read More »
    NETWORKS
    2010
    123views Computer Networks» more  NETWORKS 2010»
    Optical index of fault tolerant routings in WDM networks
    13 years 9 months ago
    Optical index of fault tolerant routings in WDM networks
    Download  www.lirmm.fr
    Maˇnuch and Stacho [7] introduced the problem of designing f-tolerant routings in optical networks, i.e., routings which still satisfy the given requests even if f failures occur...
    Stéphane Bessy, Clément Lepelletier
    claim paper
    Read More »
    NETWORKS
    2010
    321views Computer Networks» more  NETWORKS 2010»
    Computational experience with a SDP-based algorithm for maximum cut with limited unbalance
    13 years 9 months ago
    Computational experience with a SDP-based algorithm for maximum cut with limited unbalance
    Download  www.euro-online.org
    Giulia Galbiati, Stefano Gualandi, Francesco Maffi...
    claim paper
    Read More »
    123next ›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.