580 search results - page 35 / 116 » Approximation Algorithms for Temporal Reasoning |
115
click to vote
ECAI
2006
Springer
15 years 6 months ago
2006
Springer
The fundamental operation of dominance testing, i.e., determining if one alternative is preferred to another, is in general very hard for methods of reasoning with qualitative cond...
157
click to vote
ILP
2004
Springer
15 years 7 months ago
2004
Springer
One challenge faced by many Inductive Logic Programming (ILP) systems is poor scalability to problems with large search spaces and many examples. Randomized search methods such as ...
115
click to vote
LICS
2009
IEEE
15 years 9 months ago
2009
IEEE
In this paper we introduce “clipping,” a new method of syntactic approximation which is motivated by and works in conjunction with a sound and decidable denotational model for...
167
click to vote
AI
2011
Springer
14 years 6 months ago
2011
Springer
Probabilistic inference in graphical models is a prevalent task in statistics and artificial intelligence. The ability to perform this inference task efficiently is critical in l...
119
click to vote
DIMACS
1996
15 years 3 months ago
1996
There is a growing recognition of the need to apply formal mathematical methods in the design of \high con dence" computing systems. Such systems operate in safety critical co...