Sciweavers

    225 search results - page 11 / 45
    » Approximating Parameterized Convex Optimization Problems
    Sort
    View
    EOR
    2006
    103views more  EOR 2006»
    Exact solutions to a class of stochastic generalized assignment problems
    13 years 9 months ago
    Exact solutions to a class of stochastic generalized assignment problems
    Download  edoc.hu-berlin.de
    This paper deals with a stochastic Generalized Assignment Problem with recourse. Only a random subset of the given set of jobs will require to be actually processed. An assignment...
    Maria Albareda-Sambola, Maarten H. van der Vlerk, ...
    claim paper
    Read More »
    CORR
    2008
    Springer
    127views Education» more  CORR 2008»
    MAPEL: Achieving Global Optimality for a Non-convex Wireless Power Control Problem
    13 years 10 months ago
    MAPEL: Achieving Global Optimality for a Non-convex Wireless Power Control Problem
    Download  personal.ie.cuhk.edu.hk
    Achieving weighted throughput maximization (WTM) through power control has been a long standing open problem in interference-limited wireless networks. The complicated coupling bet...
    Liping Qian, Ying Jun Zhang, Jianwei Huang
    claim paper
    Read More »
    FCT
    2007
    Springer
    151views Applied Computing» more  FCT 2007»
    On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time
    14 years 1 months ago
    On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time
    Download  ccc.cs.uni-duesseldorf.de
    We investigate issues regarding two hard problems related to voting, the optimal weighted lobbying problem and the winner problem for Dodgson elections. Regarding the former, Chris...
    Gábor Erdélyi, Lane A. Hemaspaandra,...
    claim paper
    Read More »
    SIAMCOMP
    2008
    137views more  SIAMCOMP 2008»
    Approximate Shortest Paths in Anisotropic Regions
    13 years 9 months ago
    Approximate Shortest Paths in Anisotropic Regions
    Download  www.cs.ust.hk
    Our goal is to find an approximate shortest path for a point robot moving in a planar subdivision with n vertices. Let 1 be a real number. Distances in each face of this subdivis...
    Siu-Wing Cheng, Hyeon-Suk Na, Antoine Vigneron, Ya...
    claim paper
    Read More »
    SODA
    1992
    ACM
    140views Algorithms» more  SODA 1992»
    Separation and Approximation of Polyhedral Objects
    13 years 11 months ago
    Separation and Approximation of Polyhedral Objects
    Download  www.ams.sunysb.edu
    Given a family of disjoint polygons P1, P2, : : :, Pk in the plane, and an integer parameter m, it is NP-complete to decide if the Pi's can be pairwise separated by a polygon...
    Joseph S. B. Mitchell, Subhash Suri
    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.