Sciweavers

    NETWORKS
    2006
    106views Computer Networks» more  NETWORKS 2006»
    Black hole search in common interconnection networks
    13 years 11 months ago
    Black hole search in common interconnection networks
    Download  www.site.uottawa.ca
    Mobile agents operating in networked environments face threats from other agents as well as from the hosts (i.e., network sites) they visit. A black hole is a harmful host that de...
    Stefan Dobrev, Paola Flocchini, Rastislav Kralovic...
    claim paper
    Read More »
    NETWORKS
    2006
    121views Computer Networks» more  NETWORKS 2006»
    A simple algorithm that proves half-integrality of bidirected network programming
    13 years 11 months ago
    A simple algorithm that proves half-integrality of bidirected network programming
    Download  www.math.binghamton.edu
    In a bidirected graph, each end of each edge is independently oriented. We show how to express any column of the incidence matrix as a half-integral linear combination of any colum...
    Ethan D. Bolker, Thomas Zaslavsky
    claim paper
    Read More »
    NETWORKS
    2006
    76views Computer Networks» more  NETWORKS 2006»
    Efficiency and fairness of system-optimal routing with user constraints
    13 years 11 months ago
    Efficiency and fairness of system-optimal routing with user constraints
    Download  www.columbia.edu
    Andreas S. Schulz, Nicolás E. Stier Moses
    claim paper
    Read More »
    NETWORKS
    2006
    128views Computer Networks» more  NETWORKS 2006»
    The approach-dependent, time-dependent, label-constrained shortest path problem
    13 years 11 months ago
    The approach-dependent, time-dependent, label-constrained shortest path problem
    Download  scholar.lib.vt.edu
    Hanif D. Sherali, Chawalit Jeenanunta, Antoine G. ...
    claim paper
    Read More »
    NETWORKS
    2006
    93views Computer Networks» more  NETWORKS 2006»
    Extreme point characterizations for infinite network flow problems
    13 years 11 months ago
    Extreme point characterizations for infinite network flow problems
    Download  www-personal.umich.edu
    We study capacitated network flow problems with supplies and demands defined on a countably infinite collection of nodes having finite degree. This class of network flow models in...
    H. Edwin Romeijn, Dushyant Sharma, Robert L. Smith
    claim paper
    Read More »
    NETWORKS
    2006
    73views Computer Networks» more  NETWORKS 2006»
    An improved deniable authentication protocol
    13 years 11 months ago
    An improved deniable authentication protocol
    Download  paper.ijcsns.org
    Jun Shao, Zhenfu Cao, Rongxing Lu
    claim paper
    Read More »
    NETWORKS
    2006
    98views Computer Networks» more  NETWORKS 2006»
    Fault tolerant on-board networks with priorities
    13 years 11 months ago
    Fault tolerant on-board networks with priorities
    Download  www.i3s.unice.fr
    Jean-Claude Bermond, Frédéric Havet,...
    claim paper
    Read More »
    NETWORKS
    2006
    89views Computer Networks» more  NETWORKS 2006»
    Approximation algorithms for channel allocation problems in broadcast networks
    13 years 11 months ago
    Approximation algorithms for channel allocation problems in broadcast networks
    Download  www.cs.umd.edu
    We study two packing problems that arise in the area of dissemination-based information systems; a second theme is the study of distributed approximation algorithms. The problems c...
    Rajiv Gandhi, Samir Khuller, Aravind Srinivasan, N...
    claim paper
    Read More »
    NETWORKS
    2006
    71views Computer Networks» more  NETWORKS 2006»
    Upgrading arcs to minimize the maximum travel time in a network
    13 years 11 months ago
    Upgrading arcs to minimize the maximum travel time in a network
    Download  myweb.uiowa.edu
    Ann Melissa Campbell, Timothy J. Lowe, Li Zhang
    claim paper
    Read More »
    NETWORKS
    2006
    111views Computer Networks» more  NETWORKS 2006»
    Lower bounds for the relative greedy algorithm for approximating Steiner trees
    13 years 11 months ago
    Lower bounds for the relative greedy algorithm for approximating Steiner trees
    Download  www.matheon.de
    Abstract. The Steiner tree problem is to find a shortest subgraph that spans a given set of vertices in a graph. This problem is known to be NP-hard and it is well known that a pol...
    Stefan Hougardy, Stefan Kirchner
    claim paper
    Read More »
    « first‹ previous…115116117118119120121122123…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.