Sciweavers

    2355 search results - page 48 / 471
    » Scheduling in the Z-Polyhedral Model
    Sort
    View
    APCSAC
    2005
    IEEE
    104views Computer Architecture» more  APCSAC 2005»
    Rule-Based Power-Balanced VLIW Instruction Scheduling with Uncertainty
    14 years 3 months ago
    Rule-Based Power-Balanced VLIW Instruction Scheduling with Uncertainty
    Download  www-ist.massey.ac.nz
    Abstract. Power-balanced instruction scheduling for Very Long Instruction Word (VLIW) processors is an optimization problem which requires a good instruction-level power model for ...
    Shu Xiao, Edmund Ming-Kit Lai, A. Benjamin Premkum...
    claim paper
    Read More »
    INFOCOM
    2010
    IEEE
    218views Communications» more  INFOCOM 2010»
    Understanding Sub-stream Scheduling in P2P Hybrid Live Streaming Systems
    13 years 8 months ago
    Understanding Sub-stream Scheduling in P2P Hybrid Live Streaming Systems
    Download  repository.ust.hk
    —The P2P pull-push hybrid architecture has achieved great success in delivering live video traffic over the Internet. However, a formal study on the sub-stream scheduling proble...
    Zhenjiang Li, Danny H. K. Tsang, Wang-Chien Lee
    claim paper
    Read More »
    WSC
    2000
    122views Modeling And Simulation» more  WSC 2000»
    An analytical model and an optimal scheduling heuristic for collective resource management
    13 years 11 months ago
    An analytical model and an optimal scheduling heuristic for collective resource management
    Download  www.informs-sim.org
    In the this paper, we study the problem of collective resource management. We first introduce the problem through realworld examples. Then we generalize the problem and build an a...
    Qiang Sun
    claim paper
    Read More »
    KBS
    2007
    56views more  KBS 2007»
    Domain-dependent distributed models for railway scheduling
    13 years 9 months ago
    Domain-dependent distributed models for railway scheduling
    Download  users.dsic.upv.es
    Many combinatorial problems can be modelled as Constraint Satisfaction Problems (CSPs). Solving a general CSP is known to be NP-complete, so closure and heuristic search are usual...
    Miguel A. Salido, Montserrat Abril, Federico Barbe...
    claim paper
    Read More »
    SOPR
    2002
    106views more  SOPR 2002»
    A discrete simulation model for assessing software project scheduling policies
    13 years 9 months ago
    A discrete simulation model for assessing software project scheduling policies
    Download  www.ipd.uka.de
    Good project scheduling is an essential, but extremely hard task in software management practice. In a software project, the time needed to complete some development activity is d...
    Frank Padberg
    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.