Sciweavers

    209 search results - page 9 / 42
    » An executable formal semantics of C with applications
    Sort
    View
    WWW
    2003
    ACM
    182views Internet Technology» more  WWW 2003»
    SweetDeal: representing agent contracts with exceptions using XML rules, ontologies, and process descriptions
    14 years 8 months ago
    SweetDeal: representing agent contracts with exceptions using XML rules, ontologies, and process descriptions
    Download  ebusiness.mit.edu
    SweetDeal is a rule-based approach to representation of business contracts that enables software agents to create, evaluate, negotiate, and execute contracts with substantial auto...
    Benjamin N. Grosof, Terrence C. Poon
    claim paper
    Read More »
    DEBU
    2008
    149views more  DEBU 2008»
    Semantics enhanced Services: METEOR-S, SAWSDL and SA-REST
    13 years 7 months ago
    Semantics enhanced Services: METEOR-S, SAWSDL and SA-REST
    Download  sites.computer.org
    Services Research Lab at the Knoesis center and the LSDIS lab at University of Georgia have played a significant role in advancing the state of research in the areas of workflow m...
    Amit P. Sheth, Karthik Gomadam, Ajith Ranabahu
    claim paper
    Read More »
    AAAI
    1990
    73views Intelligent Agents» more  AAAI 1990»
    Very Fast Decision Table Execution of Propositional Expert Systems
    13 years 8 months ago
    Very Fast Decision Table Execution of Propositional Expert Systems
    Download  www.aaai.org
    A formal equivalence between propositional expert systems and decision tables is proved, and a practicable procedure given to perform the transformation between propositional expe...
    Robert M. Colomb, Charles Y. C. Chung
    claim paper
    Read More »
    WCET
    2007
    148views Software Engineering» more  WCET 2007»
    Automatic Amortised Worst-Case Execution Time Analysis
    13 years 8 months ago
    Automatic Amortised Worst-Case Execution Time Analysis
    Download  www.irit.fr
    Our research focuses on formally bounded WCET analysis, where we aim to provide absolute guarantees on execution time bounds. In this paper, we describe how amortisation can be us...
    Christoph A. Herrmann, Armelle Bonenfant, Kevin Ha...
    claim paper
    Read More »
    AUSAI
    2007
    Springer
    67views Artificial Intelligence» more  AUSAI 2007»
    Planning as Satisfiability with Relaxed $-Step Plans
    13 years 11 months ago
    Planning as Satisfiability with Relaxed $-Step Plans
    Download  swt.informatik.uni-freiburg.de
    Planning as satisfiability is a powerful approach to solving domain independent planning problems. In this paper, we consider a relaxed semantics for plans with parallel operator a...
    Martin Wehrle, Jussi Rintanen
    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.