Learn More
Planning is a complex reasoning task that is well suited for the study of improving performance and knowledge by learning, i.e. by accumulation and interpretation of planning experience. PRODIGY is an architecture that integrates planning with multiple learning mechanisms. Learning occurs at the planner’s decision points and integration in PRODIGY is(More)
This paper formalizes the notion of justified plans , which captures the intuition behind “good” plans. A justified plan is one that does not contain operators which are not necessary for achieving a goal. The importance of formalizing this notion is due to two reasons. First, it gives rise to methods for optimizing a given plan by removing “useless”(More)
We present a formal description of the planning algorithm used in the Prodigy4.0 system. The algorithm is based on an interesting combination of backward-chaining planning and simulation of plan execution. The backward-chainer selects goal-relevant operators, and then Prodigy simulates their application to the current state of the world. The system can use(More)
We describe a technique for fast compression of time series, indexing of compressed series, and retrieval of series similar to a given pattern. The compression procedure identifies “important” points of a series and discards the other points. We use the important points not only for compression, but also for indexing a database of time series. Experiments(More)
The purpose of a clinical trial is to evaluate a new treatment procedure. When medical researchers conduct a trial, they recruit participants with appropriate health problems and medical histories. To select participants, they analyze medical records of the available patients, which has traditionally been a manual procedure. We describe an expert system(More)
A restricted-orientation convex set, also called an O-convex set, is a set of points whose intersection with lines from some fixed set is empty or connected. The notion of O-convexity generalizes standard convexity and orthogonal convexity. We explore some of the basic properties of O-convex sets in two and higher dimensions. We also study O-connected sets,(More)
The choice of the right problem-solving method, from available methods, is a crucial skill for experts in many areas. We present a technique for automatic selection among methods based on analysis of their past performances. We formalize the statistical problem involved in choosing an efficient method, derive a solution to this problem, and describe a(More)