Sciweavers

    1197 search results - page 62 / 240
    » Which Dynamic Constraint Problems Can Be Solved By Ants
    Sort
    View
    IOR
    2006
    93views more  IOR 2006»
    A Branch-and-Price Algorithm for the Multilevel Generalized Assignment Problem
    13 years 9 months ago
    A Branch-and-Price Algorithm for the Multilevel Generalized Assignment Problem
    Download  www.crema.unimi.it
    The multilevel generalized assignment problem (MGAP) is a variation of the generalized assignment problem, in which agents can execute tasks at different efficiency levels with di...
    Alberto Ceselli, Giovanni Righini
    claim paper
    Read More »
    CPAIOR
    2007
    Springer
    150views Operations Research» more  CPAIOR 2007»
    Hybrid Local Search for Constrained Financial Portfolio Selection Problems
    14 years 3 months ago
    Hybrid Local Search for Constrained Financial Portfolio Selection Problems
    Download  www.diegm.uniud.it
    Portfolio selection is a relevant problem arising in finance and economics. While its basic formulations can be efficiently solved through linear or quadratic programming, its mor...
    Luca Di Gaspero, Giacomo di Tollo, Andrea Roli, An...
    claim paper
    Read More »
    CORR
    2010
    Springer
    146views Education» more  CORR 2010»
    Optimal power allocation for downstream xDSL with per-modem total power constraints : Broadcast Channel Optimal Spectrum Balanci
    13 years 9 months ago
    Optimal power allocation for downstream xDSL with per-modem total power constraints : Broadcast Channel Optimal Spectrum Balanci
    Download  ftp.esat.kuleuven.ac.be
    Abstract-Recently, the duality between Multiple Input Multiple Output (MIMO) Multiple Access Channels (MAC) and MIMO Broadcast Channels (BC) has been established under a total powe...
    Vincent Le Nir, Marc Moonen, Jan Verlinden, Mamoun...
    claim paper
    Read More »
    ICASSP
    2009
    IEEE
    126views Signal Processing» more  ICASSP 2009»
    Design of robust superdirective beamformers as a convex optimization problem
    14 years 1 months ago
    Design of robust superdirective beamformers as a convex optimization problem
    Download  www.lms.lnt.de
    Broadband data-independent beamforming designs aiming at constant beamwidth often lead to superdirective beamformers for low frequencies, if the sensor spacing is small relative t...
    Edwin Mabande, Adrian Schad, Walter Kellermann
    claim paper
    Read More »
    CONSTRAINTS
    2008
    138views more  CONSTRAINTS 2008»
    Minimization of Locally Defined Submodular Functions by Optimal Soft Arc Consistency
    13 years 9 months ago
    Minimization of Locally Defined Submodular Functions by Optimal Soft Arc Consistency
    Download  www.crt.umontreal.ca
    Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
    Martin C. Cooper
    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.