AAAI
1997
13 years 11 months ago
1997
Constraint satisfaction research has focussed on consistency checking using k-consistency and its variations such as arc-consistency, and path-consistency. We define a new form of...
AAAI
1997
13 years 11 months ago
1997
AAAI
1997
13 years 11 months ago
1997
One of the important components of a local search strategy for satisfiability testing is the variable selection heuristic, which determines the next variable to be flipped. In a...
AAAI
1997
13 years 11 months ago
1997
We present empirical evidence that the distribution of e ort required to solve CSPs randomly generated at the 50% satis able point, when using a backtracking algorithm, can be app...
AAAI
1997
13 years 11 months ago
1997
The Ontolingua ontology development environment provides a suite of ontology authoring tools and a library of modular reusable ontologies. The environment is available as a World ...
AAAI
1997
13 years 11 months ago
1997
We consider the problem of query plan optimization in information brokers. Information brokers are programs that facilitate access to collections of information sources by hiding ...
AAAI
1997
13 years 11 months ago
1997
Many stochastic planning problems can be represented using Markov Decision Processes (MDPs). A difficulty with using these MDP representations is that the common algorithms for so...
AAAI
1997
13 years 11 months ago
1997
AAAI
1997
13 years 11 months ago
1997
AAAI
1997
13 years 11 months ago
1997
The minimum-distance classifier summarizes each class with a prototype and then uses a nearest neighbor approach for classification. Three drawbacks of the original minimum-distan...