4324 search results - page 707 / 865 » A Generalized Representer Theorem |
159
click to vote
ITC
1994
IEEE
15 years 8 months ago
1994
IEEE
Previous approaches to designing random pattern testable circuits use post-synthesis test point insertion to eliminate random pattern resistant (r.p.r.) faults. The approach taken...
135
click to vote
TIME
1994
IEEE
15 years 8 months ago
1994
IEEE
We describe a discrete time probabilitylogic for use as the representation language of a temporal knowledge base. In addition to the usual expressive power of a discrete temporal ...
168
click to vote
SIGSOFT
1994
ACM
15 years 8 months ago
1994
ACM
Program slicing is a fundamental operation for many software engineering tools. Currently, the most efficient algorithm for interprocedural slicing is one that uses a program repr...
152
click to vote
KR
1992
Springer
15 years 8 months ago
1992
Springer
While the task of answering queries from an arbitrary propositional theory is intractable in general, it can typicallybe performed e ciently if the theory is Horn. This suggests t...
123
click to vote
KR
1992
Springer
15 years 8 months ago
1992
Springer
In this paper, we view planning as a special case of reasoning about indefinite actions. We treat actions as predicates defined over a linear temporal order. This formalism permit...