Sciweavers

    6 search results - page 2 / 2
    » The Lambek-Grishin calculus is NP-complete
    Sort
    View
    KBSE
    2007
    IEEE
    118views Software Engineering» more  KBSE 2007»
    Ensuring consistency in long running transactions
    13 years 11 months ago
    Ensuring consistency in long running transactions
    Download  fmdb.cs.ucla.edu
    Flow composition languages permit the construction of longrunning transactions from collections of independent, atomic services. Due to environmental limitations, such transaction...
    Jeffrey Fischer, Rupak Majumdar
    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.