Sciweavers

    7 search results - page 2 / 2
    » Finite time bounds for sampling based fitted value iteration
    Sort
    View
    ICALP
    2009
    Springer
    211views Programming Languages» more  ICALP 2009»
    LTL Path Checking Is Efficiently Parallelizable
    14 years 5 months ago
    LTL Path Checking Is Efficiently Parallelizable
    Download  react.cs.uni-sb.de
    We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
    Lars Kuhtz, Bernd Finkbeiner
    claim paper
    Read More »
    STOC
    2010
    ACM
    261views Algorithms» more  STOC 2010»
    An Improved LP-based Approximation for Steiner Tree
    13 years 10 months ago
    An Improved LP-based Approximation for Steiner Tree
    Download  disopt.epfl.ch
    The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
    Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvoss...
    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.