Sciweavers

    445 search results - page 86 / 89
    » Model Checking Quantitative Linear Time Logic
    Sort
    View
    CCS
    2005
    ACM
    146views Security Privacy» more  CCS 2005»
    A framework for concrete reputation-systems with applications to history-based access control
    14 years 28 days ago
    A framework for concrete reputation-systems with applications to history-based access control
    Download  eprints.ecs.soton.ac.uk
    In a reputation-based trust-management system, agents maintain information about the past behaviour of other agents. This information is used to guide future trust-based decisions...
    Karl Krukow, Mogens Nielsen, Vladimiro Sassone
    claim paper
    Read More »
    FCCM
    2003
    IEEE
    148views VLSI» more  FCCM 2003»
    A Hardware Gaussian Noise Generator for Channel Code Evaluation
    14 years 21 days ago
    A Hardware Gaussian Noise Generator for Channel Code Evaluation
    Download  www.ee.ucla.edu
    Hardware simulation of channel codes offers the potential of improving code evaluation speed by orders of magnitude over workstation- or PC-based simulation. We describe a hardwar...
    Dong-U Lee, Wayne Luk, John D. Villasenor, Peter Y...
    claim paper
    Read More »
    TABLEAUX
    2009
    Springer
    265views Artificial Intelligence» more  TABLEAUX 2009»
    A Novel Architecture for Situation Awareness Systems
    14 years 1 months ago
    A Novel Architecture for Situation Awareness Systems
    Download  www.comp.mq.edu.au
    Situation Awareness (SA) is the problem of comprehending elements of an environment within a volume of time and space. It is a crucial factor in decision-making in dynamic environm...
    Franz Baader, Andreas Bauer 0002, Peter Baumgartne...
    claim paper
    Read More »
    QEST
    2008
    IEEE
    145views Modeling and Simulation» more  QEST 2008»
    Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems
    14 years 1 months ago
    Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems
    Download  www.era.lib.ed.ac.uk
    We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
    Kousha Etessami, Dominik Wojtczak, Mihalis Yannaka...
    claim paper
    Read More »
    CIE
    2007
    Springer
    127views Applied Computing» more  CIE 2007»
    Computational Complexity of Constraint Satisfaction
    14 years 1 months ago
    Computational Complexity of Constraint Satisfaction
    Download  www.thi.uni-hannover.de
    Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
    Heribert Vollmer
    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.