Titlebook: Distributed Applications and Interoperable Systems; 6th IFIP WG 6.1 Inte Frank Eliassen,Alberto Montresor Conference proceedings 2006 IFIP

Kennedy

書目名稱Distributed Applications and Interoperable Systems影響因子(影響力)




書目名稱Distributed Applications and Interoperable Systems影響因子(影響力)學科排名




書目名稱Distributed Applications and Interoperable Systems網絡公開度




書目名稱Distributed Applications and Interoperable Systems網絡公開度學科排名




書目名稱Distributed Applications and Interoperable Systems被引頻次




書目名稱Distributed Applications and Interoperable Systems被引頻次學科排名




書目名稱Distributed Applications and Interoperable Systems年度引用




書目名稱Distributed Applications and Interoperable Systems年度引用學科排名




書目名稱Distributed Applications and Interoperable Systems讀者反饋




書目名稱Distributed Applications and Interoperable Systems讀者反饋學科排名

愚笨

hermetic

Mobile Process Description and Execution,lications is proposed. It supports such migrating processes and helps to execute them under the restrictions typically imposed by realistic mobile applications. In particular, this paper proposes a corresponding . and an . for mobile and distributed (business) processes in the context of the project

browbeat

SYN

Bph773

Bph773

Conference proceedings 2006ocuses on architectures, m- els, technologies and platforms for interoperable, scalable and adaptable systems that are related to the latest trends towards service orientation and self-* pr- erties. The papers presented at DAIS 2006 cover methodological aspects, tools and language of building adapta

制定

婚姻生活

Fundamentals of Mathematical Logic,lications is proposed. It supports such migrating processes and helps to execute them under the restrictions typically imposed by realistic mobile applications. In particular, this paper proposes a corresponding . and an . for mobile and distributed (business) processes in the context of the project

BUDGE

The Disentanglement of Populationspplied to recommending movies. We find that, in general, a random selection of peers gives surprisingly good recommendations in comparison to very similar peers that must be discovered using expensive search techniques. Our study suggests that simple decentralized recommendation techniques can do su