3446 search results - page 460 / 690 » A Reasoning Algorithm for pD* |
157
click to vote
SIGSOFT
1994
ACM
15 years 10 months ago
1994
ACM
In this paper we present an approach, based on data ow analysis, that can provide cost-e ective analysis of concurrent programs with respect to explicitly stated correctness prope...
148
click to vote
AINA
2007
IEEE
15 years 10 months ago
2007
IEEE
Many Ubiquitous computing applications can be considered as planning and acting problems in environments characterised by uncertainty and partial observability. Such systems rely ...
173
click to vote
ECML
2007
Springer
15 years 9 months ago
2007
Springer
Mining frequent patterns is a major topic in data mining research, resulting in many seminal papers and algorithms on item set and episode discovery. The combination of these, call...
185
Voted
APPROX
2006
Springer
15 years 9 months ago
2006
Springer
In this paper, we develop a new "robust mixing" framework for reasoning about adversarially modified Markov Chains (AMMC). Let P be the transition matrix of an irreducib...
186
click to vote
ASIAN
2006
Springer
15 years 9 months ago
2006
Springer
Polyhedral analysis [9] is an abstract interpretation used for automatic discovery of invariant linear inequalities among numerical varia program. Convexity of this abstract domain...