Modularity and rigor are two key elements for multi-agent technology. Hong Zhu's multi-agent system (MAS) development method provides proper language facilities supporting modularity. To enhance this method with r...
详细信息
Modularity and rigor are two key elements for multi-agent technology. Hong Zhu's multi-agent system (MAS) development method provides proper language facilities supporting modularity. To enhance this method with rigor advocates a DL method to map the specification of MAS into a DL TBox. Thus, we can use the existing DL reasoners and systems to verify and validate some system's properties.
Coordination is of great significance to multi-agent systems, and in recent years, there has been much fruitful achievement in this area, such as refinement of dependencies under some hypothesis, the dynamic selection...
详细信息
ISBN:
(纸本)9781932415988
Coordination is of great significance to multi-agent systems, and in recent years, there has been much fruitful achievement in this area, such as refinement of dependencies under some hypothesis, the dynamic selection of coordination mechanisms, new coordination models using swarm intelligence, new methods using varied techniques like case based reasoning, reinforcement learning, distributed logic programming, game theory, etc.. In this paper, we survey these achievement as a general study of coordination, including, the nature of coordination, coordination mechanisms, coordination approaches, relationship among coordination mechanisms and approaches, coordination methodologies, conversational aspects of coordination and software architectures. And along with this survey, we give our view of future research direction of coordination.
In this paper, we describe a fast semi-automatic segmentation algorithm. A nodes aggregation method is proposed for improving the running time and a Graph-Cuts method is used to model the segmentation problem. The who...
详细信息
In Containing Order Rough Set Methodology (CORS), ordered attribute 'criterion' is introduced. Criterion is related semantically with decision attributes, which results in producing more rational and significa...
详细信息
In this paper, we present an efficient method for detecting collisions between highly deformable objects, which is a combination of newly developed stochastic method and Particle Swarm Optimization (PSO) algorithm. Fi...
详细信息
Identification of Transcription Factor Binding Sites (TFBS) from the upstream region of genes remains a highly important and unsolved problem particularly in higher eukaryotic genomes. In this paper, we propose a nove...
详细信息
Sequential pattern mining is one of the most important fields in data mining. In this paper, we propose a novel algorithm FSPAN (Fast Sequential Pattern mining algorithm) to do the sequence mining. FSPAN can mine all ...
详细信息
Coordination models can be classified into several classes, such as data-driven vs. control-driven coordination models, dependent vs. emergent coordination models, and hybrid coordination models. All these classificat...
详细信息
ISBN:
(纸本)9781932415988
Coordination models can be classified into several classes, such as data-driven vs. control-driven coordination models, dependent vs. emergent coordination models, and hybrid coordination models. All these classifications are based upon implementation details. However, interaction is the kernel aspect of coordination, and coordination is the outcome of interactions between agents, so here, we give another kind of taxonomy based on interaction types, which are coordination models based on direct interactions and indirect interactions. Using this taxonomy, all coordination models are classified into two classes with no intersection, in addition, coordination models with indirect interactions and emergent behaviors are the direction of future work.
We propose an algorithm for learning hierarchical user interest models according to the Web pages users have browsed. In this algorithm, the interests of a user are represented into a tree which is called a user inter...
详细信息
We propose an algorithm for learning hierarchical user interest models according to the Web pages users have browsed. In this algorithm, the interests of a user are represented into a tree which is called a user interest tree, the content and the structure of which can change simultaneously to adapt to the changes in a user＇s interests. This expression represents a user＇s specific and general interests as a continuurn. In some sense, specific interests correspond to shortterm interests, while general interests correspond to longterm interests. So this representation more really reflects the users＇ interests. The algorithm can automatically model a us er＇s multiple interest domains, dynamically generate the in terest models and prune a user interest tree when the number of the nodes in it exceeds given value. Finally, we show the experiment results in a Chinese Web Site.
The complex mapping z ← zα is important in dynamical application, but it is not received as much attention in the literature as the mapping z ← zα+c, for there is not fractal structure by using escape time algorit...
详细信息
暂无评论