Sciweavers

    6693 search results - page 1170 / 1339
    » On an anytime algorithm for control
    Sort
    View
    DAGSTUHL
    1996
    97views Software Engineering» more  DAGSTUHL 1996»
    Pragmatics of Type-Directed Partial Evaluation
    13 years 9 months ago
    Pragmatics of Type-Directed Partial Evaluation
    Download  repository.readscheme.org
    Abstract. Type-directed partial evaluation stems from the residualization of arbitrary static values in dynamic contexts, given their type. Its algorithm coincides with the one for...
    Olivier Danvy
    claim paper
    Read More »
    DIMACS
    1996
    106views Theoretical Computer Science» more  DIMACS 1996»
    Model Checking and the Mu-calculus
    13 years 9 months ago
    Model Checking and the Mu-calculus
    Download  www.ccs.neu.edu
    There is a growing recognition of the need to apply formal mathematical methods in the design of \high con dence" computing systems. Such systems operate in safety critical co...
    E. Allen Emerson
    claim paper
    Read More »
    ACL
    1990
    132views Computational Linguistics» more  ACL 1990»
    Deterministic Left to Right Parsing of Tree Adjoining Languages
    13 years 9 months ago
    Deterministic Left to Right Parsing of Tree Adjoining Languages
    Download  www.aclweb.org
    We define a set of deterministic bottom-up left to right parsers which analyze a subset of Tree Adjoining Languages. The LR parsing strategy for Context Free Grammars is extended ...
    Yves Schabes, K. Vijay-Shanker
    claim paper
    Read More »
    DAGSTUHL
    1990
    108views Software Engineering» more  DAGSTUHL 1990»
    Parallel Rule-Firing Production Systems
    13 years 9 months ago
    Parallel Rule-Firing Production Systems
    Download  mas.cs.umass.edu
    One of the principal advantages of parallelizing a rule-based system, or more generally, any A.I. system, is the ability to pursue alternate search paths concurrently. Conventiona...
    Daniel Neimann
    claim paper
    Read More »
    LFP
    1992
    153views more  LFP 1992»
    Reasoning About Programs in Continuation-Passing Style
    13 years 9 months ago
    Reasoning About Programs in Continuation-Passing Style
    Download  www.ccs.neu.edu
    The CPS transformation dates back to the early 1970's, where it arose as a technique to represent the control flow of programs in -calculus based programming languages as -te...
    Amr Sabry, Matthias Felleisen
    claim paper
    Read More »
    « Prev « First page 1170 / 1339 Last » Next »
    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.