Sciweavers

    182 search results - page 18 / 37
    » Benchmarking the Task Graph Scheduling Algorithms
    Sort
    View
    RTSS
    1992
    IEEE
    157views Control Systems» more  RTSS 1992»
    Allocation of periodic task modules with precedence and deadline constraints in distributed real-time systems
    15 years 1 months ago
    Allocation of periodic task modules with precedence and deadline constraints in distributed real-time systems
    Download  lion.cs.uiuc.edu
    This paper addresses the problem of allocating (assigning and scheduling) periodic task modules to processing nodes in distributed real-time systems subject to task precedence and ...
    Chao-Ju Hou, Kang G. Shin
    claim paper
    Read More »
    DAC
    2009
    ACM
    141views Computer Architecture» more  DAC 2009»
    Efficient SAT solving for non-clausal formulas using DPLL, graphs, and watched cuts
    15 years 10 months ago
    Efficient SAT solving for non-clausal formulas using DPLL, graphs, and watched cuts
    Download  www.cs.cmu.edu
    Boolean satisfiability (SAT) solvers are used heavily in hardware and software verification tools for checking satisfiability of Boolean formulas. Most state-of-the-art SAT solver...
    Himanshu Jain, Edmund M. Clarke
    claim paper
    Read More »
    ISCAPDCS
    2003
    145views Distributed And Parallel Com...» more  ISCAPDCS 2003»
    Optimal Graph Transformation Assuming Alternate Scheduling Models
    14 years 11 months ago
    Optimal Graph Transformation Assuming Alternate Scheduling Models
    Download  www.cs.uakron.edu
    Many computation-intensive iterative or recursive applications commonly found in digital signal processing and image processing applications can be represented by data-flow graph...
    Timothy W. O'Neil
    claim paper
    Read More »
    68
    Voted
    COR
    2008
    118views more  COR 2008»
    An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
    14 years 9 months ago
    An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
    Download  www.tamps.cinvestav.mx
    In this paper, an improved Two-Stage Simulated Annealing algorithm is presented for the Minimum Linear Arrangement Problem for Graphs. This algorithm integrates several distinguis...
    Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-...
    claim paper
    Read More »
    MP
    2002
    85views more  MP 2002»
    From fluid relaxations to practical algorithms for job shop scheduling: the makespan objective
    14 years 9 months ago
    From fluid relaxations to practical algorithms for job shop scheduling: the makespan objective
    Download  www.columbia.edu
    We design an algorithm, called the fluid synchronization algorithm (FSA), for the job shop scheduling problem with the objective of minimizing the makespan. We round an optimal sol...
    Dimitris Bertsimas, Jay Sethuraman
    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-2025, USA.