Sciweavers

    4998 search results - page 11 / 1000
    » The case for intentional networking
    Sort
    View
    LCN
    2003
    IEEE
    148views Computer Networks» more  LCN 2003»
    A Performance Study of Fast Handovers for Mobile IPv6
    14 years 1 months ago
    A Performance Study of Fast Handovers for Mobile IPv6
    Download  www.cs.ucy.ac.cy
    We conducted a simulative evaluation of the overall performance of Fast Handovers for Mobile IPv6 in comparison with the baseline Mobile IPv6 using the network simulator ns-2 for ...
    Marc Torrent-Moreno, Xavier Pérez Costa, Se...
    claim paper
    Read More »
    DAC
    1996
    ACM
    129views Computer Architecture» more  DAC 1996»
    Optimal Clock Skew Scheduling Tolerant to Process Variations
    14 years 23 days ago
    Optimal Clock Skew Scheduling Tolerant to Process Variations
    Download  www.ece.rochester.edu
    1- A methodology is presented in this paper for determining an optimal set of clock path delays for designing high performance VLSI/ULSI-based clock distribution networks. This met...
    José Luis Neves, Eby G. Friedman
    claim paper
    Read More »
    NETWORKING
    2000
    88views Computer Networks» more  NETWORKING 2000»
    Worst-Case Deterministic Delay Bounds for Arbitrary Weighted Generalized Processor Sharing Schedulers
    13 years 10 months ago
    Worst-Case Deterministic Delay Bounds for Arbitrary Weighted Generalized Processor Sharing Schedulers
    Download  qosip.tmit.bme.hu
    Róbert Szabó, Peter Barta, Felician ...
    claim paper
    Read More »
    NETWORKS
    2008
    316views Computer Networks» more  NETWORKS 2008»
    The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases
    13 years 8 months ago
    The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases
    Download  pluto.mscc.huji.ac.il
    Asaf Levin, Daniël Paulusma, Gerhard J. Woegi...
    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 »
    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.