Sciweavers

    2576 search results - page 33 / 516
    » The Complexity of Zero Knowledge
    Sort
    View
    IJCAI
    1993
    93views Artificial Intelligence» more  IJCAI 1993»
    The Complexity of Nested Counterfactuals and Iterated Knowledge Base Revisions
    15 years 1 months ago
    The Complexity of Nested Counterfactuals and Iterated Knowledge Base Revisions
    Download  dli.iiit.ac.in
    We consider the computational complexity of evaluating nested counterfactuals over a propositional knowledge base. Counterfactual implication models a statement "if p, then q...
    Thomas Eiter, Georg Gottlob
    claim paper
    Read More »
    AIMDM
    1999
    Springer
    305views Artificial Intelligence» more  AIMDM 1999»
    Knowledge-Based Event Detection in Complex Time Series Data
    15 years 4 months ago
    Knowledge-Based Event Detection in Complex Time Series Data
    Download  www.csd.abdn.ac.uk
    This paper describes an approach to the detection of events in complex, multi-channel, high frequency data. The example used is that of detecting the re-siting of a transcutaneous ...
    Jim Hunter, Neil McIntosh
    claim paper
    Read More »
    ISTA
    2007
    136views Information Technology» more  ISTA 2007»
    Knowledge-Oriented Approach to the Main Pipeline Complex Dispatching Control
    15 years 1 months ago
    Knowledge-Oriented Approach to the Main Pipeline Complex Dispatching Control
    Download  subs.emis.de
    : The article is devoted to the development of knowledge-oriented models that are able to increase the efficiency and quality of main pipeline complex (MPC) dispatching control. Th...
    O. Ye. Fedorovich, A. V. Prokhorov, K. V. Golovan
    claim paper
    Read More »
    FOCM
    2008
    76views more  FOCM 2008»
    On Smale's 17th Problem: A Probabilistic Positive Solution
    14 years 12 months ago
    On Smale's 17th Problem: A Probabilistic Positive Solution
    Download  cs.nyu.edu
    Smale's 17th Problem asks "Can a zero of n complex polynomial equations in n unknowns be found approximately, on the average [for a suitable probability measure on the s...
    Carlos Beltrán, Luis Miguel Pardo
    claim paper
    Read More »
    ICLP
    2007
    Springer
    131views Automated Reasoning» more  ICLP 2007»
    Approximating Horn Knowledge Bases in Regular Description Logics to Have PTIME Data Complexity
    15 years 6 months ago
    Approximating Horn Knowledge Bases in Regular Description Logics to Have PTIME Data Complexity
    Download  www.mimuw.edu.pl
    Linh Anh Nguyen
    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-2025, USA.