Low latency, application, specific multipliers are required for m,any DSP algorithms. Tree multipliers are an obvious answer to this requirement. However, tree architectures have ...
Abstract. A domain-specific service registry should satisfy two requirements at least: coping with diverse service description requirements from different services; supporting sema...
Kun Chen, Yanbo Han, Dongju Yang, Yongshan Wei, Wu...
We show how quantified constraints expressed in a sub-language of first-order logic, againstashareddatamodelthatisfreetoevolve, provideanexcellentwayof transporting domain-specific...
Kit-ying Hui, Peter M. D. Gray, Graham J. L. Kemp,...
An adaptation contract describes composition constraints and adaptation requirements among several services which were not initially built to interoperate with each other. The man...
We argue that producing maintainable high-performance implementations of finite element methods for multiple targets requires that they are written using a high-level domain-speci...