Sciweavers

    438 search results - page 8 / 88
    » A (1-1 e)-approximation algorithm for the generalized assign...
    Sort
    View
    ICCAD
    2009
    IEEE
    154views Hardware» more  ICCAD 2009»
    Pad assignment for die-stacking System-in-Package design
    13 years 5 months ago
    Pad assignment for die-stacking System-in-Package design
    Download  home.eng.iastate.edu
    Wire bonding is the most popular method to connect signals between dies in System-in-Package (SiP) design nowadays. Pad assignment, which assigns inter-die signals to die pads so ...
    Yu-Chen Lin, Wai-Kei Mak, Chris Chu, Ting-Chi Wang
    claim paper
    Read More »
    APPROX
    2009
    Springer
    138views Algorithms» more  APPROX 2009»
    Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
    14 years 2 months ago
    Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
    Download  www.math.princeton.edu
    Submodular-function maximization is a central problem in combinatorial optimization, generalizing many important NP-hard problems including Max Cut in digraphs, graphs and hypergr...
    Jon Lee, Maxim Sviridenko, Jan Vondrák
    claim paper
    Read More »
    ANOR
    2010
    112views more  ANOR 2010»
    The Multi-Story Space Assignment Problem
    13 years 7 months ago
    The Multi-Story Space Assignment Problem
    Download  www.seas.upenn.edu
    -- The Multi-Story Space Assignment Problem (MSAP) is an innovative formulation of the multi-story facility assignment problem that allows one to model the location of departments ...
    Peter M. Hahn, J. MacGregor Smith, Yi-Rong Zhu
    claim paper
    Read More »
    ALT
    2011
    Springer
    244views Machine Learning» more  ALT 2011»
    On Noise-Tolerant Learning of Sparse Parities and Related Problems
    12 years 7 months ago
    On Noise-Tolerant Learning of Sparse Parities and Related Problems
    Download  www.cc.gatech.edu
    We consider the problem of learning sparse parities in the presence of noise. For learning parities on r out of n variables, we give an algorithm that runs in time poly log 1 δ , ...
    Elena Grigorescu, Lev Reyzin, Santosh Vempala
    claim paper
    Read More »
    CONSTRAINTS
    2007
    122views more  CONSTRAINTS 2007»
    Stochastic Local Search Algorithms for Graph Set T -colouring and Frequency Assignment
    13 years 7 months ago
    Stochastic Local Search Algorithms for Graph Set T -colouring and Frequency Assignment
    Download  www.imada.sdu.dk
    The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...
    Marco Chiarandini, Thomas Stützle
    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.