2 resultados para granularity
em Department of Computer Science E-Repository - King's College London, Strand, London
Resumo:
In the past decade, compositional modelling (CM) has established itself as the predominant knowledge-based approach to construct mathematical (simulation) models automatically. Although it is mainly applied to physical systems, there is a growing interest in applying CM to other domains, such as ecological and socio-economic systems. Inspired by this observation, this paper presents a method for extending the conventional CM techniques to suit systems that are fundamentally presented by interacting populations of individuals instead of physical components or processes. The work supports building model repositories for such systems, especially in addressing the most critical outstanding issues of granularity and disaggregation in ecological systems modelling.
Resumo:
Dynamic composition of services provides the ability to build complex distributed applications at run time by combining existing services, thus coping with a large variety of complex requirements that cannot be met by individual services alone. However, with the increasing amount of available services that differ in granularity (amount of functionality provided) and qualities, selecting the best combination of services becomes very complex. In response, this paper addresses the challenges of service selection, and makes a twofold contribution. First, a rich representation of compositional planning knowledge is provided, allowing the expression of multiple decompositions of tasks at arbitrary levels of granularity. Second, two distinct search space reduction techniques are introduced, the application of which, prior to performing service selection, results in significant improvement in selection performance in terms of execution time, which is demonstrated via experimental results.