Sciweavers

    1199 search results - page 163 / 240
    » Parameterized Proof Complexity
    Sort
    View
    CLEIEJ
    2006
    88views more  CLEIEJ 2006»
    A Stochastic Concurrent Constraint Based Framework to Model and Verify Biological Systems
    13 years 9 months ago
    A Stochastic Concurrent Constraint Based Framework to Model and Verify Biological Systems
    Download  www.clei.cl
    Concurrent process calculi are powerful formalisms for modelling concurrent systems. The mathematical style underlying process calculi allow to both model and verify properties of...
    Carlos Olarte, Camilo Rueda
    claim paper
    Read More »
    JAR
    2006
    103views more  JAR 2006»
    A Framework for Verifying Bit-Level Pipelined Machines Based on Automated Deduction and Decision Procedures
    13 years 8 months ago
    A Framework for Verifying Bit-Level Pipelined Machines Based on Automated Deduction and Decision Procedures
    Download  www.ccs.neu.edu
    We describe an approach to verifying bit-level pipelined machine models using a combination of deductive reasoning and decision procedures. While theorem proving systems such as AC...
    Panagiotis Manolios, Sudarshan K. Srinivasan
    claim paper
    Read More »
    ENTCS
    2007
    121views more  ENTCS 2007»
    Incremental Parametric Development of Greedy Algorithms
    13 years 8 months ago
    Incremental Parametric Development of Greedy Algorithms
    Download  hal.archives-ouvertes.fr
    The event B method provides a general framework for modelling both data structures and algorithms. B models are validated by discharging proof obligations ensuring safety properti...
    Dominique Cansell, Dominique Méry
    claim paper
    Read More »
    COCO
    2003
    Springer
    118views Algorithms» more  COCO 2003»
    Lower bounds for predecessor searching in the cell probe model
    14 years 2 months ago
    Lower bounds for predecessor searching in the cell probe model
    Download  webhome.cs.uvic.ca
    We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
    Pranab Sen
    claim paper
    Read More »
    STOC
    2009
    ACM
    181views Algorithms» more  STOC 2009»
    The detectability lemma and quantum gap amplification
    14 years 9 months ago
    The detectability lemma and quantum gap amplification
    Download  www.cs.berkeley.edu
    The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
    Dorit Aharonov, Itai Arad, Zeph Landau, Umesh V. V...
    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.