Titlebook: Cooperative Information Agents X; 10th International W Matthias Klusch,Michael Rovatsos,Terry R. Payne Conference proceedings 2006 Springer

Goiter

書目名稱Cooperative Information Agents X影響因子(影響力)




書目名稱Cooperative Information Agents X影響因子(影響力)學科排名




書目名稱Cooperative Information Agents X網(wǎng)絡公開度




書目名稱Cooperative Information Agents X網(wǎng)絡公開度學科排名




書目名稱Cooperative Information Agents X被引頻次




書目名稱Cooperative Information Agents X被引頻次學科排名




書目名稱Cooperative Information Agents X年度引用




書目名稱Cooperative Information Agents X年度引用學科排名




書目名稱Cooperative Information Agents X讀者反饋




書目名稱Cooperative Information Agents X讀者反饋學科排名

同步左右

Accord

真

Voting in Cooperative Information Agent Scenarios: Use and Abuse on the subject of voting, with important theoretical results, and builders of automated agents can benefit from this work as they engineer systems that reach group consensus..This paper considers the application of various voting techniques, and examines nuances in their use. In particular, we cons

商品

debouch

Information Agents for Optimal Repurposing and Personalization of Web Contents in Semantics-Aware Ubconditions that may depend on device capabilities, network connectivity, navigation context, user preferences, user disabilities and existing social conventions. Semantic annotations can provide additional information so that a content adaptation engine, based on the holistic integration of both Inf

debouch

確定方向

MAUVE

Agent-Based Analysis and Support for Incident Management formal approach for the specification and hierarchical verification of both traces and properties. Incomplete traces are enriched by enrichment rules. Furthermore, a classification mechanism is presented for the different properties in incident management that is based on psychological literature.

啜泣

A Distributed Agent Implementation of Multiple Species Flocking Model for Document Partitioning Clusapplications, such as animation. Our early research has resulted in a flock clustering algorithm that can achieve better performance than the K-means or the Ant clustering algorithms for data clustering. This algorithm generates a clustering of a given set of data through the embedding of the high-d