ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

feed icon rss

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
Filter
  • Articles  (6)
  • Blackwell Publishing Ltd  (6)
  • 2020-2023
  • 2020-2020
  • 1995-1999  (6)
  • 1965-1969
  • 1950-1954
  • Computer Science  (6)
  • 1
    Electronic Resource
    Electronic Resource
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 12 (1996), S. 0 
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: This article deals with the problem of providing Kowalski and Sergot's event calculus, extended with context dependency, with an efficient implementation in a logic programming framework. Despite a widespread recognition that a positive solution to efficiency issues is necessary to guarantee the computational feasibility of existing approaches to temporal reasoning, the problem of analyzing the complexity of temporal reasoning programs has been largely overlooked. This article provides a mathematical analysis of the efficiency of query and update processing in the event calculus and defines a cached version of the calculus that (i) moves computational complexity from query to update processing and (ii) features an absolute improvement of performance, because query processing in the event calculus costs much more than update processing in the proposed cached version.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 11 (1995), S. 0 
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: In this paper, we introduce the notion of interval structures in an attempt to establish a unified framework for representing uncertain information. Two views are suggested for the interpretation of an interval structure. A typical example using the compatibility view is the rough set model in which the lower and upper approximations form an interval structure. Incidence calculus adopts the allocation view in which an interval structure is defined by the tightest lower and upper incidence bounds. The relationship between interval structures and interval-based numeric belief and plausibility functions is also examined. As an application of the proposed model, an algorithm is developed for computing the tightest incidence bounds.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 11 (1995), S. 0 
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: The inverted pendulum poses serious problems for qualitative modeling methods, so it is a good benchmark to lest their performance. This paper shows how a new data analysis method known as rough set theory can be utilized to swing up and stabilize the pendulum. Our approach to this task consists of deriving control rules from the actions of a human operator stabilizing the pendulum and subsequently using them for automatic control. Rule derivation is based on the “learning from examples” principle and does not require knowledge of a quantitative model of the system.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 12 (1996), S. 0 
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: As they gain expertise in problem solving, people increasingly rely on patterns and spatially oriented reasoning. This paper describes an associative visual-pattern classifier and the automated acquisition of new, spatially oriented reasoning agents that simulate such behavior. They are incorporated into a multi-agent game-learning program whose architecture robustly combines agents with conflicting perspectives. When tested on three games, the visual-pattern classifier learns meaningful patterns, and the pattern-based, spatially oriented agents generalized from these patterns are generally correct. The accuracy of the contribution of each of the newly created agents to the decision-making process is measured against an expert opponent, and a perceptron-Iike algorithm is used to learn game-specific weights for these agents. Much of the knowledge encapsulated by the new agents was previously inexpressible in the program's representation and in some cases is not readily deducible from the rules.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 12 (1996), S. 0 
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 12 (1996), S. 0 
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Many decades ago, Japanese professional Go-Moku players stated that Go-Moku (five-in-a-row on a horizontally placed 15×15 board) is a won game for the player to move first. So far, this claim has never been substantiated by (a tree of) variations or by a computer program. Meanwhile, many variants of Go-Moku with slightly different rules have been developed. This paper shows that for two common variants, the game-theoretical value has been established.Moreover, the Go-Moku program Victoria is described. It uses two new search techniques: threat-space search and proof-number search. One of the results is that Victoria is bound to win against any (optimal) counterplay if it moves first. Furthermore, it achieves good results as a defender against nonoptimally playing opponents. In this contribution we focus on threat-space search and its advantages compared to conventional search algorithms.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...