Sciweavers

    SOICT
    2010
    146views Information Technology» more  SOICT 2010»
    Constraint-based local search for solving non-simple paths problems on graphs: application to the routing for network covering p
    12 years 11 months ago
    Constraint-based local search for solving non-simple paths problems on graphs: application to the routing for network covering p
    Download  becool.info.ucl.ac.be
    Routing problems have been considered as central problems in the fields of transportation, distribution and logistics. LS(Graph) is a generic framework allowing to model and solve...
    Pham Quang Dung, Phan-Thuan Do, Yves Deville, Tuon...
    claim paper
    Read More »
    TON
    2002
    91views more  TON 2002»
    The stable paths problem and interdomain routing
    13 years 4 months ago
    The stable paths problem and interdomain routing
    Download  www.cs.princeton.edu
    Abstract-Dynamic routing protocols such as RIP and OSPF essentially implement distributed algorithms for solving the Shortest Paths Problem. The Border Gateway Protocol (BGP) is cu...
    Timothy Griffin, F. Bruce Shepherd, Gordon T. Wilf...
    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.