Sciweavers

    57 search results - page 3 / 12
    » Pebbling and Branching Programs Solving the Tree Evaluation ...
    Sort
    View
    AAAI
    1998
    100views Intelligent Agents» more  AAAI 1998»
    Branch and Bound Algorithm Selection by Performance Prediction
    13 years 6 months ago
    Branch and Bound Algorithm Selection by Performance Prediction
    Download  www.aaai.org
    Wepropose a method called Selection by Performance Prediction (SPP) which allows one, when faced with a particular problem instance, to select a Branch and Boundalgorithm from amo...
    Lionel Lobjois, Michel Lemaître
    claim paper
    Read More »
    CCE
    2008
    152views Software Engineering» more  CCE 2008»
    Bidirectional branch and bound for controlled variable selection: Part I. Principles and minimum singular value criterion
    13 years 5 months ago
    Bidirectional branch and bound for controlled variable selection: Part I. Principles and minimum singular value criterion
    Download  dspace.lib.cranfield.ac.uk
    The minimum singular value (MSV) rule is a useful tool for selecting controlled variables (CVs) from the available measurements. However, the application of the MSV rule to large-...
    Yi Cao, Vinay Kariwala
    claim paper
    Read More »
    IPCO
    2008
    118views Optimization» more  IPCO 2008»
    Constraint Orbital Branching
    13 years 6 months ago
    Constraint Orbital Branching
    Download  homepages.cae.wisc.edu
    Orbital branching is a method for branching on variables in integer programming that reduces the likelihood of evaluating redundant, isomorphic nodes in the branch-and-bound proce...
    James Ostrowski, Jeff Linderoth, Fabrizio Rossi, S...
    claim paper
    Read More »
    ICDT
    2010
    ACM
    141views Database» more  ICDT 2010»
    The Complexity of Rooted Phylogeny problems
    13 years 9 months ago
    The Complexity of Rooted Phylogeny problems
    Download  www.edbt.org
    Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
    Manuel Bodirsky, Jens K. Mueller
    claim paper
    Read More »
    INFORMS
    2006
    87views more  INFORMS 2006»
    Early Estimates of the Size of Branch-and-Bound Trees
    13 years 5 months ago
    Early Estimates of the Size of Branch-and-Bound Trees
    Download  integer.tepper.cmu.edu
    This paper intends to show that the time needed to solve mixed integer programming problems by branch and bound can be roughly predicted early in the solution process. We construc...
    Gérard Cornuéjols, Miroslav Karamano...
    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.