Sciweavers

    ENTCS
    2008
    94views more  ENTCS 2008»
    On the Convergence of Reduction-based and Model-based Methods in Proof Theory
    13 years 10 months ago
    On the Convergence of Reduction-based and Model-based Methods in Proof Theory
    Download  www.lix.polytechnique.fr
    In the recent past, the reduction-based and the model-based methods to prove cut elimination have converged, so that they now appear just as two sides of the same coin. This paper...
    Gilles Dowek
    claim paper
    Read More »
    ENTCS
    2008
    390views more  ENTCS 2008»
    Cryptographic Versus Trust-based Methods for MANET Routing Security
    13 years 10 months ago
    Cryptographic Versus Trust-based Methods for MANET Routing Security
    Download  www.cse.msstate.edu
    Mobile Ad-hoc Networks (MANETs) allow wireless nodes to form a network without requiring a fixed infrastructure. Early routing protocols for MANETs failed to take security issues ...
    Jared Cordasco, Susanne Wetzel
    claim paper
    Read More »
    ENTCS
    2008
    118views more  ENTCS 2008»
    Shared Hash Tables in Parallel Model Checking
    13 years 10 months ago
    Shared Hash Tables in Parallel Model Checking
    Download  anna.fi.muni.cz
    In light of recent shift towards shared-memory systems in parallel explicit model checking, we explore relative advantages and disadvantages of shared versus private hash tables. ...
    Jiri Barnat, Petr Rockai
    claim paper
    Read More »
    ENTCS
    2010
    113views more  ENTCS 2010»
    Automated Computing of the Maximal Number of Handled Clients for Client-Server Systems
    13 years 10 months ago
    Automated Computing of the Maximal Number of Handled Clients for Client-Server Systems
    Download  anna.fi.muni.cz
    Pavlína Vareková, I. Vareková...
    claim paper
    Read More »
    ENTCS
    2008
    98views more  ENTCS 2008»
    On Finite-time Computability Preserving Conversions
    13 years 11 months ago
    On Finite-time Computability Preserving Conversions
    Download  www.jucs.org
    : A finite-time computable function is a partial function from to whose value is constructed by concatenating a finite list with a suffix of the argument. A finite-time computabili...
    Hideki Tsuiki, Shuji Yamada
    claim paper
    Read More »
    ENTCS
    2008
    124views more  ENTCS 2008»
    Stability for Effective Algebras
    13 years 11 months ago
    Stability for Effective Algebras
    Download  www.cs.swan.ac.uk
    We give a general method for showing that all numberings of certain effective algebras are recursively equivalent. The method is based on computable approximation-limit pairs. The...
    Jens Blanck, Viggo Stoltenberg-Hansen, John V. Tuc...
    claim paper
    Read More »
    ENTCS
    2008
    120views more  ENTCS 2008»
    Characterizing Computable Analysis with Differential Equations
    13 years 11 months ago
    Characterizing Computable Analysis with Differential Equations
    Download  www.math.ist.utl.pt
    Manuel Lameiras Campagnolo, Kerry Ojakian
    claim paper
    Read More »
    ENTCS
    2008
    144views more  ENTCS 2008»
    Platform Independent Timing of Java Virtual Machine Bytecode Instructions
    13 years 11 months ago
    Platform Independent Timing of Java Virtual Machine Bytecode Instructions
    Download  www.cs.may.ie
    The accurate measurement of the execution time of Java bytecode is one factor that is important in order to estimate the total execution time of a Java application running on a Ja...
    Jonathan M. Lambert, James F. Power
    claim paper
    Read More »
    ENTCS
    2008
    97views more  ENTCS 2008»
    Parallel Model Checking Large-Scale Genetic Regulatory Networks with DiVinE
    13 years 11 months ago
    Parallel Model Checking Large-Scale Genetic Regulatory Networks with DiVinE
    Download  anna.fi.muni.cz
    Jiri Barnat, Lubos Brim, Ivana Cerná, Sven ...
    claim paper
    Read More »
    ENTCS
    2008
    153views more  ENTCS 2008»
    Efficient Conflict Detection in Graph Transformation Systems by Essential Critical Pairs
    13 years 11 months ago
    Efficient Conflict Detection in Graph Transformation Systems by Essential Critical Pairs
    Download  tfs.cs.tu-berlin.de
    The well-known notion of critical pairs already allows a static conflict detection, which is important for all kinds of applications and already implemented in AGG. Unfortunately ...
    Leen Lambers, Hartmut Ehrig, Fernando Orejas
    claim paper
    Read More »
    « first‹ previous123456789…next ›last »
    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.