2020 search results - page 91 / 404 » KDD Process Planning |
122
click to vote
ECML
2005
Springer
15 years 9 months ago
2005
Springer
This paper examines the problem of finding an optimal policy for a Partially Observable Markov Decision Process (POMDP) when the model is not known or is only poorly specified. W...
122
click to vote
APSEC
1998
IEEE
15 years 8 months ago
1998
IEEE
When implementing an application system in a distributed computing environment, several architectural questions arise such as, how and where computing resources are distributed, a...
145
click to vote
CAISE
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. Formal specification and operational support of time constraints constitute fundamental challenges for any process-aware information system. Although temporal constraints...
146
click to vote
ICTAI
2009
IEEE
15 years 2 months ago
2009
IEEE
We introduce TiMDPpoly, an algorithm designed to solve planning problems with durative actions, under probabilistic uncertainty, in a non-stationary, continuous-time context. Miss...
243
click to vote
ICDE
2008
IEEE
16 years 5 months ago
2008
IEEE
In a data stream management system, a continuous query is processed by an execution plan consisting of multiple operators connected via the "consumer-producer" relationsh...