1330 search results - page 176 / 266 » No Classic Boundary Conditions |
180
click to vote
ICML
2000
IEEE
15 years 10 months ago
2000
IEEE
We propose a new rule induction algorithm for solving classification problems via probability estimation. The main advantage of decision rules is their simplicity and good interp...
214
click to vote
ECP
1999
Springer
15 years 10 months ago
1999
Springer
We consider the problem of planning optimally in potentially concurrent probabilistic domains: actions have probabilistic effects and may execute in parallel under certain conditi...
170
click to vote
APN
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Consider a Markovian Petri net with race policy. The marking process has a "product form" stationary distribution if the probability of viewing a given marking ...
153
click to vote
AUSAI
2007
Springer
15 years 10 months ago
2007
Springer
Planning as satisfiability is a powerful approach to solving domain independent planning problems. In this paper, we consider a relaxed semantics for plans with parallel operator a...
141
click to vote
SOFSEM
1997
Springer
15 years 9 months ago
1997
Springer
Abstract. We examine the problem of finite-state representability of infinitestate processes w.r.t. certain behavioural equivalences. We show that the classical notion of regularit...