Sciweavers

    680 search results - page 119 / 136
    » Complexity of Strict Implication
    Sort
    View
    FUIN
    2007
    135views more  FUIN 2007»
    On First-Order Fragments for Mazurkiewicz Traces
    13 years 7 months ago
    On First-Order Fragments for Mazurkiewicz Traces
    Download  www.fmi.uni-stuttgart.de
    Mazurkiewicz traces form a model for concurrency. Temporal logic st-order logic are important tools in order to deal with the abstract behavior of such systems. Since typical prop...
    Volker Diekert, Martin Horsch, Manfred Kufleitner
    claim paper
    Read More »
    JSA
    2007
    191views more  JSA 2007»
    Automated memory-aware application distribution for Multi-processor System-on-Chips
    13 years 7 months ago
    Automated memory-aware application distribution for Multi-processor System-on-Chips
    Download  zakalwe.fi
    Mapping of applications on a Multiprocessor System-on-Chip (MP-SoC) is a crucial step to optimize performance, energy and memory constraints at the same time. The problem is formu...
    Heikki Orsila, Tero Kangas, Erno Salminen, Timo D....
    claim paper
    Read More »
    JSYML
    2007
    100views more  JSYML 2007»
    Combinatorial principles weaker than Ramsey's Theorem for pairs
    13 years 7 months ago
    Combinatorial principles weaker than Ramsey's Theorem for pairs
    Download  www.math.uchicago.edu
    We investigate the complexity of various combinatorial theorems about linear and partial orders, from the points of view of computability theory and reverse mathematics. We focus ...
    Denis R. Hirschfeldt, Richard A. Shore
    claim paper
    Read More »
    JOC
    2000
    95views more  JOC 2000»
    Player Simulation and General Adversary Structures in Perfect Multiparty Computation
    13 years 7 months ago
    Player Simulation and General Adversary Structures in Perfect Multiparty Computation
    Download  reference.kfupm.edu.sa
    The goal of secure multiparty computation is to transform a given protocol involving a trusted party into a protocol without need for the trusted party, by simulating the party am...
    Martin Hirt, Ueli M. Maurer
    claim paper
    Read More »
    AML
    1998
    60views more  AML 1998»
    A restricted computation model on Scott domains and its partial primitive recursive functionals
    13 years 7 months ago
    A restricted computation model on Scott domains and its partial primitive recursive functionals
    Download  www.tu-ilmenau.de
    The paper builds on both a simply typed term system PRω and a computation model on Scott domains via so-called parallel typed while programs (PTWP). The former provides a notion ...
    Karl-Heinz Niggl
    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.