Sciweavers

3161 search results - page 84 / 633
» A Discourse on Complexity of Process Models
Sort
View
NIPS
2003
14 years 11 months ago
Linear Program Approximations for Factored Continuous-State Markov Decision Processes
Approximate linear programming (ALP) has emerged recently as one of the most promising methods for solving complex factored MDPs with finite state spaces. In this work we show th...
Milos Hauskrecht, Branislav Kveton
BPM
2007
Springer
165views Business» more  BPM 2007»
15 years 1 months ago
Modeling Requirements for Value Configuration Design
Breadth and depth complexity are key challenges in achieving business process fusion as the enabler for value configuration design. The PARM framework is proposed as the requiremen...
Eng Chew, Igor Hawryszkiewycz, Michael Soanes
IPPS
1998
IEEE
15 years 2 months ago
Memory Space Representation for Heterogeneous Network Process Migration
A major difficulty of heterogeneous process migration is how to collect advanced dynamic data-structures, transform them into machine independent form, and restor them appropriate...
Kasidit Chanchio, Xian-He Sun
ADBIS
2007
Springer
125views Database» more  ADBIS 2007»
15 years 4 months ago
Towards Self-Optimization of Message Transformation Processes
The Message Transformation Model (MTM), for modeling complex message transformation processes in data centric application scenarios, provides strong capabilities for describing the...
Matthias Böhm, Dirk Habich, Uwe Wloka, Jü...
EMSOFT
2004
Springer
15 years 3 months ago
Multiple process execution in cache related preemption delay analysis
Cache prediction for preemptive scheduling is an open issue despite its practical importance. First analysis approaches use simplified models for cache behavior or they assume si...
Jan Staschulat, Rolf Ernst