Sciweavers

    406 search results - page 65 / 82
    » Gadgets, Approximation, and Linear Programming
    Sort
    View
    FOCS
    2007
    IEEE
    174views Theoretical Computer Science» more  FOCS 2007»
    On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract)
    15 years 3 months ago
    On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract)
    Download  homepages.inf.ed.ac.uk
    d Abstract) Kousha Etessami LFCS, School of Informatics University of Edinburgh Mihalis Yannakakis Department of Computer Science Columbia University We reexamine what it means to...
    Kousha Etessami, Mihalis Yannakakis
    claim paper
    Read More »
    128
    Voted
    SIAMCOMP
    2010
    174views more  SIAMCOMP 2010»
    On the Complexity of Nash Equilibria and Other Fixed Points
    14 years 7 months ago
    On the Complexity of Nash Equilibria and Other Fixed Points
    Download  homepages.inf.ed.ac.uk
    We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity o...
    Kousha Etessami, Mihalis Yannakakis
    claim paper
    Read More »
    90
    Voted
    ALGORITHMICA
    2002
    120views more  ALGORITHMICA 2002»
    An Experimental Study of Algorithms for Weighted Completion Time Scheduling
    14 years 9 months ago
    An Experimental Study of Algorithms for Weighted Completion Time Scheduling
    Download  domino.research.ibm.com
    We consider the total weighted completion time scheduling problem for parallel identical machines and precedence constraints, P jprecj PwiCi. This important and broad class of pro...
    Ivan D. Baev, Waleed Meleis, Alexandre E. Eichenbe...
    claim paper
    Read More »
    CDC
    2008
    IEEE
    132views Control Systems» more  CDC 2008»
    A distributed auction algorithm for the assignment problem
    15 years 4 months ago
    A distributed auction algorithm for the assignment problem
    Download  www.cis.upenn.edu
    — The assignment problem constitutes one of the fundamental problems in the context of linear programming. Besides its theoretical significance, its frequent appearance in the a...
    Michael M. Zavlanos, Leonid Spesivtsev, George J. ...
    claim paper
    Read More »
    NIPS
    2007
    156views Information Technology» more  NIPS 2007»
    An Analysis of Convex Relaxations for MAP Estimation
    14 years 11 months ago
    An Analysis of Convex Relaxations for MAP Estimation
    Download  books.nips.cc
    The problem of obtaining the maximum a posteriori estimate of a general discrete random field (i.e. a random field defined using a finite and discrete set of labels) is known ...
    Pawan Mudigonda, Vladimir Kolmogorov, Philip H. S....
    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-2025, USA.