703 search results - page 27 / 141 » Using Cases Utility for Heuristic Planning Improvement |
ICWS
2007
IEEE
13 years 9 months ago
2007
IEEE
Workflows often operate in volatile environments in which the component services’ QoS changes frequently. Optimally adapting to these changes becomes an important problem that ...
ALGORITHMICA
1998
13 years 7 months ago
1998
We study the performance of the Timestamp(0) (TS(0)) algorithm for self-organizing sequential search on discrete memoryless sources. We demonstrate that TS(0) is better than Move-...
DEXA
2005
Springer
14 years 1 months ago
2005
Springer
The main challenge of mining sequential patterns is the high processing cost of support counting for large amount of candidate patterns. For solving this problem, SPAM algorithm wa...
IWANN
2009
Springer
14 years 2 months ago
2009
Springer
Generating test data for formal state based specifications is computationally expensive. This paper improves a framework that addresses this issue by representing the test data ge...
SOCO
2008
Springer
13 years 7 months ago
2008
Springer
Self-adaptive component-based architectures provide methods and mechanisms to support the dynamic adaptation of their structure under evolving execution context. Dynamic adaptation...