Sciweavers

    1536 search results - page 2 / 308
    » DPS - Dynamic Parallel Schedules
    Sort
    View
    AAAI
    1997
    130views Intelligent Agents» more  AAAI 1997»
    Using CSP Look-Back Techniques to Solve Real-World SAT Instances
    13 years 6 months ago
    Using CSP Look-Back Techniques to Solve Real-World SAT Instances
    Download  www.bayardo.org
    We report on the performance of an enhanced version of the “Davis-Putnam” (DP) proof procedure for propositional satisfiability (SAT) on large instances derived from realworld...
    Roberto J. Bayardo Jr., Robert Schrag
    claim paper
    Read More »
    OSN
    2011
    260views Operations Research» more  OSN 2011»
    A parallel iterative scheduler for asynchronous Optical Packet Switching networks
    12 years 7 months ago
    A parallel iterative scheduler for asynchronous Optical Packet Switching networks
    Download  www.ait.upct.es
    —This paper presents PI-OPS (Parallel-Iterative Optical Packet Scheduler) a parallel-iterative scheduler for asynchronous Optical Packet Switching nodes with optical buffering. O...
    Pablo Pavón-Mariño, M. Victoria Buen...
    claim paper
    Read More »
    COR
    2011
    259views Applied Computing» more  COR 2011»
    Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines
    12 years 11 months ago
    Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines
    Download  num.math.uni-goettingen.de
    We consider the problem of scheduling a maximum profit selection of equal length jobs on m identical machines. Jobs arrive online over time and the goal is to determine a non-pre...
    Sven Oliver Krumke, Alfred Taudes, Stephan Westpha...
    claim paper
    Read More »
    SIAMCOMP
    2010
    104views more  SIAMCOMP 2010»
    Approximation Algorithms for Scheduling Parallel Jobs
    12 years 11 months ago
    Approximation Algorithms for Scheduling Parallel Jobs
    Download  www.informatik.uni-kiel.de
    Abstract. In this paper we study variants of the non-preemptive parallel job scheduling problem where the number of machines is polynomially bounded in the number of jobs. For this...
    Klaus Jansen, Ralf Thöle
    claim paper
    Read More »
    IJMTM
    2011
    190views more  IJMTM 2011»
    Exact and heuristic approaches for lot splitting and scheduling on identical parallel machines
    12 years 11 months ago
    Exact and heuristic approaches for lot splitting and scheduling on identical parallel machines
    Download  repositorium.sdum.uminho.pt
    : In this paper, we address a lot splitting and scheduling problem existent in a textile factory. The factory we study produces a set of products that are made of, or assembled fro...
    Carina Pimentel, Filipe Pereira Alvelos, Antonio D...
    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.