3825 search results - page 408 / 765 » The Language of Time: A Reader |
157
click to vote
AAAI
1993
15 years 8 months ago
1993
The Rete and Treat algorithms are considered the most efficient implementation techniques for Forward Chaining rule systems. These algorithms support a language of limited express...
174
click to vote
WOA
2007
15 years 8 months ago
2007
Abstract—In this work, we present a constrained-based representation for specifying the goals of “course design”, that we call curricula model, and introduce a graphical lang...
176
click to vote
ICML
2010
IEEE
15 years 8 months ago
2010
IEEE
Approximate MAP inference in graphical models is an important and challenging problem for many domains including computer vision, computational biology and natural language unders...
156
click to vote
JFP
2008
15 years 6 months ago
2008
t two complementary improvements for abstract-interpretation-based flow analysis r-order languages: (1) abstract garbage collection and (2) abstract counting.1,2 garbage collecti...
214
click to vote
NJC
2006
15 years 6 months ago
2006
Regular tree queries (RTQs) are a class of queries considered especially relevant for the expressiveness and evaluation of XML query languages. The algorithms proposed so far for ...