Sciweavers

    526 search results - page 3 / 106
    » Improved Decomposition of STGs
    Sort
    View
    CCE
    2010
    87views Software Engineering» more  CCE 2010»
    Improving benders decomposition using maximum feasible subsystem (MFS) cut generation strategy
    13 years 7 months ago
    Improving benders decomposition using maximum feasible subsystem (MFS) cut generation strategy
    Download  sol.rutgers.edu
    Georgios K. G. Saharidis, Marianthi G. Ierapetrito...
    claim paper
    Read More »
    MSOM
    2011
    194views Intelligent Agents» more  MSOM 2011»
    An Improved Dynamic Programming Decomposition Approach for Network Revenue Management
    13 years 4 months ago
    An Improved Dynamic Programming Decomposition Approach for Network Revenue Management
    Download  www.rhsmith.umd.edu
    Dan Zhang
    claim paper
    Read More »
    ACSD
    2007
    IEEE
    109views Hardware» more  ACSD 2007»
    Efficient Automatic Resolution of Encoding Conflicts Using STG Unfoldings
    14 years 1 months ago
    Efficient Automatic Resolution of Encoding Conflicts Using STG Unfoldings
    Download  www.cs.ncl.ac.uk
    Synthesis of asynchronous circuits from Signal Transition Graphs (STGs) involves resolution of state encoding conflicts by means of refining the STG specification. In this paper, ...
    Victor Khomenko
    claim paper
    Read More »
    CCE
    2006
    113views Software Engineering» more  CCE 2006»
    Lagrangean decomposition using an improved Nelder-Mead approach for Lagrangean multiplier update
    13 years 9 months ago
    Lagrangean decomposition using an improved Nelder-Mead approach for Lagrangean multiplier update
    Download  sol.rutgers.edu
    Lagrangean decomposition has been recognized as a promising approach for solving large-scale optimization problems. However, Lagrangean decomposition is critically dependent on th...
    Dan Wu, Marianthi G. Ierapetritou
    claim paper
    Read More »
    CORR
    2010
    Springer
    139views Education» more  CORR 2010»
    A recombination algorithm for the decomposition of multivariate rational functions
    13 years 4 months ago
    A recombination algorithm for the decomposition of multivariate rational functions
    Download  www.math.univ-toulouse.fr
    In this paper we show how we can compute in a deterministic way the decomposition of a multivariate rational function with a recombination strategy. The key point of our recombinat...
    Guillaume Chèze
    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.