Sciweavers

    3040 search results - page 588 / 608
    » Independent Natural Extension
    Sort
    View
    AAAI
    2000
    136views Intelligent Agents» more  AAAI 2000»
    DATALOG with Constraints - An Answer-Set Programming System
    13 years 11 months ago
    DATALOG with Constraints - An Answer-Set Programming System
    Download  www.aaai.org
    Answer-set programming (ASP) has emerged recently as a viable programming paradigm well attuned to search problems in AI, constraint satisfaction and combinatorics. Propositional ...
    Deborah East, Miroslaw Truszczynski
    claim paper
    Read More »
    DAGSTUHL
    1997
    115views Software Engineering» more  DAGSTUHL 1997»
    Scattered Data Techniques for Surfaces
    13 years 11 months ago
    Scattered Data Techniques for Surfaces
    Download  www.soe.ucsc.edu
    This survey presents several techniques for solving variants of the following scattered data interpolation problem: given a nite set of N points in R3, nd a surface that interpola...
    Suresh K. Lodha, Richard Franke
    claim paper
    Read More »
    WSC
    1998
    98views Modeling And Simulation» more  WSC 1998»
    Marine Corps Analytic Modeling and Simulation
    13 years 11 months ago
    Marine Corps Analytic Modeling and Simulation
    Download  www.informs-sim.org
    The Marine Corps has instituted a new Mission Area Analysis (MAA) process to identify operational requirements and deficiencies. In the past, the MAA process was subjective and so...
    William A. Sawyers
    claim paper
    Read More »
    AAAI
    1996
    134views Intelligent Agents» more  AAAI 1996»
    What Is Planning in the Presence of Sensing?
    13 years 11 months ago
    What Is Planning in the Presence of Sensing?
    Download  www.cs.toronto.edu
    The Airport Example The Omelette Example Copyright c 1996 American Association for Artificial Intelligence. All rights reserved. Despite the existence of programs that are able to ...
    Hector J. Levesque
    claim paper
    Read More »
    COLING
    1996
    131views Computational Linguistics» more  COLING 1996»
    Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars
    13 years 11 months ago
    Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars
    Download  staff.science.uva.nl
    This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
    Khalil Sima'an
    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.