Sciweavers

    7456 search results - page 340 / 1492
    » Parallelism in Logic Programming
    Sort
    View
    ISORC
    2007
    IEEE
    115views Distributed And Parallel Com...» more  ISORC 2007»
    Hardware-Near Programming in the Common Language Infrastructure
    16 years 29 days ago
    Hardware-Near Programming in the Common Language Infrastructure
    Download  www.dcl.hpi.uni-potsdam.de
    Stefan Richter, Andreas Rasche, Andreas Polze
    claim paper
    Read More »
    LCPC
    2007
    Springer
    113views System Software» more  LCPC 2007»
    Concurrency Analysis for Shared Memory Programs with Textually Unaligned Barriers
    16 years 24 days ago
    Concurrency Analysis for Shared Memory Programs with Textually Unaligned Barriers
    Download  polaris.cs.uiuc.edu
    Yuan Zhang, Evelyn Duesterwald, Guang R. Gao
    claim paper
    Read More »
    SIAMCOMP
    1998
    137views more  SIAMCOMP 1998»
    Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs
    15 years 6 months ago
    Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs
    Download  www.cc.gatech.edu
    We build on the classical greedy sequential set cover algorithm, in the spirit of the primal-dual schema, to obtain simple parallel approximation algorithms for the set cover probl...
    Sridhar Rajagopalan, Vijay V. Vazirani
    claim paper
    Read More »
    COR
    2011
    213views Applied Computing» more  COR 2011»
    Sampled fictitious play for approximate dynamic programming
    14 years 10 months ago
    Sampled fictitious play for approximate dynamic programming
    Download  www-personal.umich.edu
    Marina A. Epelman, Archis Ghate, Robert L. Smith
    claim paper
    Read More »
    POPL
    2002
    ACM
    124views Programming Languages» more  POPL 2002»
    Proving correctness of compiler optimizations by temporal logic
    16 years 7 months ago
    Proving correctness of compiler optimizations by temporal logic
    Download  www-users.cs.umn.edu
    Many classical compiler optimizations can be elegantly expressed using rewrite rules of form: I = I if , where I, I are intermediate language instructions and is a property expre...
    David Lacey, Neil D. Jones, Eric Van Wyk, Carl Chr...
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.