Sciweavers

    2 search results - page 1 / 1
    » Randomization in Backtrack Search: Exploiting Heavy-Tailed P...
    Sort
    View
    AIPS
    1998
    82views Artificial Intelligence» more  AIPS 1998»
    Randomization in Backtrack Search: Exploiting Heavy-Tailed Profiles for Solving Hard Scheduling Problems
    13 years 6 months ago
    Randomization in Backtrack Search: Exploiting Heavy-Tailed Profiles for Solving Hard Scheduling Problems
    Download  www.aaai.org
    Westudytheruntimeprofilesofcompletebacktrackstylesearchmethodsappliedtohardschedulingproblems.Suchsearchmethodsoftenexhibita largevariabilityinperformanceduetothenon-standardnatur...
    Carla P. Gomes, Bart Selman, Ken McAloon, Carol Tr...
    claim paper
    Read More »
    ANOR
    2007
    80views more  ANOR 2007»
    The minimum shift design problem
    13 years 5 months ago
    The minimum shift design problem
    Download  www.dbai.tuwien.ac.at
    The min-SHIFT DESIGN problem (MSD) is an important scheduling problem that needs to be solved in many industrial contexts. The issue is to find a minimum number of shifts and the...
    Luca Di Gaspero, Johannes Gärtner, Guy Kortsa...
    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.