In this paper we discuss a cognitively plausible way to represent statements of typicality. The intuition behind our approach is based on the ability of people to conjure up and reason about a mental concept, or image...
详细信息
Routing is an important function implemented in computer communication net works. There has been extensive research interest in distributed algorithms for single path routing. In many instances, it is desirable to hav...
详细信息
A technique is described for adapting the apparent structure of a hypertext to the behavior and preferences exhibited by its users while browsing. Examples are given an implementation of this technique using the timin...
详细信息
We give an on-line deterministic algorithm for the weighted bipartite matching problem that achieves a competitive ratio of (2n — 1) in any metric space. This algorithm is optimal - there is no on-line deterministic ...
详细信息
This paper presents a simple, sound, complete, and systematic algorithm for domain independent STRIPS planning. Simplicity is achieved by starting with a ground procedure and then applying a general, and independently...
The problems related to the analysis and reengineering of existing software in order to reuse it are discussed. The authors introduce a process model for component extraction and focus on the problem of analyzing and ...
详细信息
The problems related to the analysis and reengineering of existing software in order to reuse it are discussed. The authors introduce a process model for component extraction and focus on the problem of analyzing and qualifying software components which are candidates for reuse. A prototype tool for supporting the extraction of reusable components is presented. One of the components of this tool aids in understanding programs and is based on the functional model of correctness. It can assist software engineers in the process of finding correct formal specifications for programs. A detailed description of this component and an example to demonstrate a possible operational scenario are given.< >
The Omega test is an integer programming algorithm that can determine whether a dependence exists between two array references, and if so, under what conditions. Conventional wisdom holds that integer programming tech...
详细信息
The Omega test is an integer programming algorithm that can determine whether a dependence exists between two array references, and if so, under what conditions. Conventional wisdom holds that integer programming techniques are far too expensive to be used for dependence analysis, except as a method of last resort for situations that cannot be decided by simpler methods. We present evidence that suggests this wisdom is wrong, and that the Omega test is competitive with approximate algorithms used in practice and suitable for use in production compilers. The Omega test is based on an extension of FourierMotzkin variable elimination to integer programming, and has worst-case exponential time complexity. However, we show that for many situations in which other (polynomial) methods are accurate, the Omega test has low order polynomial time complexity. The Omega test can be used to simplify integer programming problems, rather than just deciding them. This has many applications, including accurately and efficiently computing dependence direction and distance vectors.
A study is performed of the issues arising in the efficient processing of spatial queries in large spatial databases. The domain is restricted to line segment databases such as those found in transportation networks a...
详细信息
The author surveys much of the work that has been done on the following two questions: (1) What functions can one compute with m queries to A? and (2) Are there functions that can be computed with m queries to A that ...
详细信息
The author surveys much of the work that has been done on the following two questions: (1) What functions can one compute with m queries to A? and (2) Are there functions that can be computed with m queries to A that cannot be computed with m-1 queries to A? To any set X? The framework is recursion-theoretic; the computations have no time or space bound.< >
暂无评论