ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Representing and Reasoning about Motion in a Two-Dimensional World (1998)
    Oxford, UK and Boston, USA : Blackwell Publishers Inc.
    Computational intelligence 14 (1998), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: We present a point-based spatiotemporal first-order logic for representing the qualitative and quantitative spatial temporal knowledge needed to reason about motion in a two-dimensional space. A feature of the logic is the uniform treatment of space and time. The knowledge of a simplified world, a two-dimensional street network with active traffic lights, is represented, and the reasoning problem of how a robot moves from one place to another in the world is formalized with the proposed logic.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/0824-7935.00061
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    facet.materialart.
    Unknown
    Representing and Reasoning about Motion in a Two-Dimensional World (1998)
    Wiley
    Details
    Publication Date: 1998-05-01
    Print ISSN: 0824-7935
    Electronic ISSN: 1467-8640
    Topics: Computer Science
    Published by Wiley
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
  • 3
    facet.materialart.
    Unknown
    An Ecological Forecasting Agent (2005)
    In:  CASI
    Details
    Publication Date: 2005-07-05
    Description: The project goals are: Make data analysis faster and cheaper. Increase use of NASA data by removing barriers to data access. Cope with data heterogeneity. Support code reuse and rapid application development. Support multiple applications, users. Including fire and health domains. Improve QOS. Always provide an answer. Tell user how good it is, where it come from.
    Keywords: Meteorology and Climatology
    Format: text
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    NASA TECHNICAL REPORTS
  • 4
    facet.materialart.
    Unknown
    Automated Data Processing as an AI Planning Problem (2003)
    In:  CASI
    Details
    Publication Date: 2019-07-13
    Description: NASA s vision for Earth Science is to build a "sensor web"; an adaptive array of heterogeneous satellites and other sensors that will track important events, such as storms, and provide real-time information about the state of the Earth to a wide variety of customers. Achieving his vision will require automation not only in the scheduling of the observations but also in the processing af tee resulting data. Ta address this need, we have developed a planner-based agent to automatically generate and execute data-flow programs to produce the requested data products. Data processing domains are substantially different from other planning domains that have been explored, and this has led us to substantially different choices in terms of representation and algorithms. We discuss some of these differences and discuss the approach we have adopted.
    Keywords: Instrumentation and Photography
    Type: 14th International Conference on Automated Planning and Scheduling; Jun 03, 2004 - Jun 07, 2004; Whistler, British Columbia; Canada
    Format: application/pdf
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    NASA TECHNICAL REPORTS
  • 5
    facet.materialart.
    Unknown
    Constraint Reasoning Over Strings (2003)
    In:  CASI
    Details
    Publication Date: 2019-07-13
    Description: This paper discusses an approach to representing and reasoning about constraints over strings. We discuss how many string domains can often be concisely represented using regular languages, and how constraints over strings, and domain operations on sets of strings, can be carried out using this representation.
    Keywords: Systems Analysis and Operations Research
    Type: Constraint Programming 2003; Sep 09, 2003; Kinsale; Ireland
    Format: application/pdf
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    NASA TECHNICAL REPORTS
  • 6
    facet.materialart.
    Unknown
    A Hybrid Constraint Representation and Reasoning Framework (2004)
    In:  CASI
    Details
    Publication Date: 2019-07-13
    Description: In this paper, we introduce JNET, a novel constraint representation and reasoning framework that supports procedural constraints and constraint attachments, providing a flexible way of integrating the constraint system with a runtime software environment and improving its applicability. We describe how JNET is applied to a real-world problem - NASA's Earth-science data processing domain, and demonstrate how JNET can be extended, without any knowledge of how it is implemented, to meet the growing demands of real-world applications.
    Keywords: Computer Systems
    Type: 10th International Conference on Principles and Practice of Constraint Programming (CP-2004); Sep 27, 2004 - Oct 01, 2004; Toronto; Canada
    Format: application/pdf
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    NASA TECHNICAL REPORTS
  • 7
    facet.materialart.
    Unknown
    Simplifying a Lifted Plan Graph Using Domain Splitting (2002)
    In:  CASI
    Details
    Publication Date: 2019-07-13
    Description: Image process planning, lifted plan graph and induced CSP splitting states and actions in lifted plan graph enables improved arc consistency in underlying CSP.
    Keywords: Mathematical and Computer Sciences (General)
    Type: 14th International Conference on Automated Planning and Scheduling; Jun 01, 2004; Canada
    Format: text
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    NASA TECHNICAL REPORTS
  • 8
    facet.materialart.
    Unknown
    A Graph Based Backtracking Algorithm for Solving General CSPs (2003)
    In:  CASI
    Details
    Publication Date: 2019-07-13
    Description: Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complete task in general, tractable classes of CSPs have been identified based on the structure of the underlying constraint graphs. Much effort has been spent on exploiting structural properties of the constraint graph to improve the efficiency of finding a solution. These efforts contributed to development of a class of CSP solving algorithms called decomposition algorithms. The strength of CSP decomposition is that its worst-case complexity depends on the structural properties of the constraint graph and is usually better than the worst-case complexity of search methods. Its practical application is limited, however, since it cannot be applied if the CSP is not decomposable. In this paper, we propose a graph based backtracking algorithm called omega-CDBT, which shares merits and overcomes the weaknesses of both decomposition and search approaches.
    Keywords: Mathematical and Computer Sciences (General)
    Type: CAI ''03 16th Canadian Conference on AI; Jun 11, 2003 - Jun 13, 2003; Nova Scotia; Canada
    Format: application/pdf
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    NASA TECHNICAL REPORTS
  • 9
    facet.materialart.
    Unknown
    Preferences in Data Production Planning (2005)
    In:  CASI
    Details
    Publication Date: 2019-07-13
    Description: This paper discusses the data production problem, which consists of transforming a set of (initial) input data into a set of (goal) output data. There are typically many choices among input data and processing algorithms, each leading to significantly different end products. To discriminate among these choices, the planner supports an input language that provides a number of constructs for specifying user preferences over data (and plan) properties. We discuss these preference constructs, how we handle them to guide search, and additional challenges in the area of preference management that this important application domain offers.
    Keywords: Documentation and Information Science
    Type: IJCAI-05 Workshop: Advances in Preference Handling; Jul 01, 2005; Scotland; United Kingdom
    Format: application/pdf
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    NASA TECHNICAL REPORTS
  • 10
    facet.materialart.
    Unknown
    A Constraint-Based Planner for Data Production (2005)
    In:  CASI
    Details
    Publication Date: 2019-07-13
    Description: This paper presents a graph-based backtracking algorithm designed to support constrain-tbased planning in data production domains. This algorithm performs backtracking at two nested levels: the outer- backtracking following the structure of the planning graph to select planner subgoals and actions to achieve them and the inner-backtracking inside a subproblem associated with a selected action to find action parameter values. We show this algorithm works well in a planner applied to automating data production in an ecological forecasting system. We also discuss how the idea of multi-level backtracking may improve efficiency of solving semi-structured constraint problems.
    Keywords: Documentation and Information Science
    Type: IJCAI-05 Workshop: Modelling and Solving Problems with Constraints; Jul 01, 2005; Scotland; United Kingdom
    Format: application/pdf
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    NASA TECHNICAL REPORTS
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...