2834 search results - page 10 / 567 » Representing Trees with Constraints |
NIPS
1990
13 years 10 months ago
1990
A new class of data structures called "bumptrees" is described. These structures are useful for efficiently implementing a number of neural network related operations. A...
AAAI
2004
13 years 10 months ago
2004
A binary constraint network is tree convex if we can construct a tree for the domain of the variables so that for any constraint, no matter what value one variable takes, all the ...
AAAI
1990
13 years 10 months ago
1990
This paper concerns the task of removing redundant information from a given knowledge base, and restructuring it in the form of a tree, so as to admit efficient problem solving ro...
AI
2008
Springer
13 years 9 months ago
2008
Springer
It is known that a tree convex network is globally consistent if it is path consistent. However, if a tree convex network is not path consistent, enforcing path consistency on it ...
FOSSACS
2007
Springer
14 years 3 months ago
2007
Springer
Tree automata with one memory have been introduced in