Sciweavers

    STOC   1994 Annual ACM Symposium on Theory of Computing
    Wall of Fame | Most Viewed STOC-1994 Paper
    STOC
    1994
    ACM
    168views Algorithms» more  STOC 1994»
    Fast algorithms for finding randomized strategies in game trees
    13 years 8 months ago
    Fast algorithms for finding randomized strategies in game trees
    Download  theory.stanford.edu
    Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
    Daphne Koller, Nimrod Megiddo, Bernhard von Stenge...
    claim paper
    Read More »
    Disclaimer and Copyright Notice
    Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
    IdReadViewsTitleStatus
    1Download preprint from source168
    Fast algorithms for finding randomized strategies in game trees
    claim
    2Download preprint from source134
    A coding theorem for distributed computation
    claim
    3Download preprint from source128
    Weakly learning DNF and characterizing statistical query learning using Fourier analysis
    claim
    4Download preprint from source125
    A spectral technique for coloring random 3-colorable graphs (preliminary version)
    claim
    5Download preprint from source123
    Natural proofs
    claim
    6Download preprint from source108
    Pseudorandomness for network algorithms
    claim
    7Download preprint from source104
    Improved data structures for fully dynamic biconnectivity
    claim
    8Download preprint from source103
    Computational geometry: a retrospective
    claim
    9Download preprint from source97
    An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane
    claim
    10Download preprint from source95
    Improved non-approximability results
    claim
    11Download preprint from source94
    Balanced allocations (extended abstract)
    claim
    12Download preprint from source93
    Scalable expanders: exploiting hierarchical random wiring
    claim
    13Download preprint from source91
    The minimum latency problem
    claim
    14Download preprint from source88
    Faster shortest-path algorithms for planar graphs
    claim
    15Download preprint from source80
    Simulating quadratic dynamical systems is PSPACE-complete (preliminary version)
    claim
    16Download preprint from source71
    On lazy randomized incremental construction
    claim
    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.