Sciweavers

767 search results - page 43 / 154
» Semantic-Based Planning of Process Models
Sort
View
ICTAI
2009
IEEE
13 years 5 months ago
TiMDPpoly: An Improved Method for Solving Time-Dependent MDPs
We introduce TiMDPpoly, an algorithm designed to solve planning problems with durative actions, under probabilistic uncertainty, in a non-stationary, continuous-time context. Miss...
Emmanuel Rachelson, Patrick Fabiani, Fréd&e...
JAIR
2006
157views more  JAIR 2006»
13 years 7 months ago
Decision-Theoretic Planning with non-Markovian Rewards
A decision process in which rewards depend on history rather than merely on the current state is called a decision process with non-Markovian rewards (NMRDP). In decisiontheoretic...
Sylvie Thiébaux, Charles Gretton, John K. S...
EKAW
2004
Springer
14 years 1 months ago
Knowledge Formulation for AI Planning
Abstract. In this paper we present an overview of the principle components of GIPO, an environment to support knowledge acquisition for AI Planning. GIPO assists in the knowledge f...
T. L. McCluskey, Ron M. Simpson
DEXAW
1997
IEEE
99views Database» more  DEXAW 1997»
13 years 12 months ago
A Framework for Dynamic Changes in Workflow Management Systems
Current workflow management systems (WFMSs) are only applicable in a reliable and secure manner, if the business process (BP) to be supported is wellstructured. As ad hoc deviatio...
Manfred Reichert, Peter Dadam
BNCOD
2011
356views Database» more  BNCOD 2011»
12 years 7 months ago
Achieving High Freshness and Optimal Throughput in CPU-Limited Execution of Multi-join Continuous Queries
Due to high data volumes and unpredictable arrival rates, continuous query systems processing expensive queries in real-time may fail to keep up with the input data streams - resul...
Abhishek Mukherji, Elke A. Rundensteiner, Matthew ...