Sciweavers

    AIPS
    1998
    82views Artificial Intelligence» more  AIPS 1998»

    Randomization in Backtrack Search: Exploiting Heavy-Tailed Profiles for Solving Hard Scheduling Problems

    14 years 1 months ago
    Randomization in Backtrack Search: Exploiting Heavy-Tailed Profiles for Solving Hard Scheduling Problems
    Download  www.aaai.org
    Westudytheruntimeprofilesofcompletebacktrackstylesearchmethodsappliedtohardschedulingproblems.Suchsearchmethodsoftenexhibita largevariabilityinperformanceduetothenon-standardnature oftheirunderlyingcostdistributions.Thedistributionsgenerallyexhibitverylongtailsor"heavytails" andarebestcharacterizedbya generalclassofdistributionsthathavenomoments(i.e.,aninfinitemean, variance,etc.).Weshowhowonecanexploitthespecialnatureofsuchdistributionstosignificantlyimproveupondeterministic completesearch procedures.
    Carla P. Gomes, Bart Selman, Ken McAloon, Carol Tr
    claim paper
    Added 01 Nov 2010
    Updated 01 Nov 2010
    Type Conference
    Year 1998
    Where AIPS
    Authors Carla P. Gomes, Bart Selman, Ken McAloon, Carol Tretkoff
    Comments (0)
    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.