This paper presents a hybrid agent architecture, which includes reactive architecture and deliberative architecture, the former enhances the reactivity of agents, and the later improves the intelligence of agents. The...
详细信息
ISBN:
(纸本)1424400600
This paper presents a hybrid agent architecture, which includes reactive architecture and deliberative architecture, the former enhances the reactivity of agents, and the later improves the intelligence of agents. The paper also introduces a novel agent decision algorithm to make agent accomplish tasks promptly and artificially. The hybrid architecture and decision algorithm had successfully applied to RoboCup simulation system, and the simulation results show they are effective.
On the characteristics of multi-source, heterogenous structure, mass data of WebGIS as well as the complexity of the system, the paper proposes the design model of the manager-agents based on Web and Multi-Agent. More...
详细信息
ISBN:
(纸本)1424400600
On the characteristics of multi-source, heterogenous structure, mass data of WebGIS as well as the complexity of the system, the paper proposes the design model of the manager-agents based on Web and Multi-Agent. Moreover, through analyzing the characteristics of WebGIS, the paper makes a further research on model of the manager-agents. It puts the emphasis on the decision-module of the manager-agent, and proposes its design model and algorithm.
This paper presents a hybrid agent architecture, which includes reactive architecture and deliberative architecture,the former enhances the reactivity of agents, and the later ivproves the intelligence of agents. The ...
详细信息
This paper presents a hybrid agent architecture, which includes reactive architecture and deliberative architecture,the former enhances the reactivity of agents, and the later ivproves the intelligence of agents. The paper also introduces a novel agent decision algorithm to make agent accomplish tasks promptly and artificially. The hybrid architecture and decision algorithm had successfully applied to RoboCup simulation system, and the simulation results show they are effective.
On the characteristics of multi-source, heterogenous structure, mass data of WebGIS as well as the complexity of the system, the paper proposes the design model of the manager-agents based on Web and Multi-Agent. More...
详细信息
On the characteristics of multi-source, heterogenous structure, mass data of WebGIS as well as the complexity of the system, the paper proposes the design model of the manager-agents based on Web and Multi-Agent. Moreover,through analyzing the characteristics of WebGIS, the paper makes a further research on model of the manager-agents. It puts the emphasis on the decision-module of the manager-agent, and proposes its design model and algorithm.
First of all, the typically dynamic workflow systems are introduced, and their main defects that are not able to decide automatically the dependences among data in workflows are analyzed. The reasons resulting in the ...
详细信息
ISBN:
(纸本)9812565329
First of all, the typically dynamic workflow systems are introduced, and their main defects that are not able to decide automatically the dependences among data in workflows are analyzed. The reasons resulting in the problem are lack of effective modeling approach and constructing algorithm of dynamic workflow, which are our main research work in this paper. Here, the Petri-Net is adopted to model the dynamic workflows. Based on the model a constructing algorithm of workflow is proposed, and the complexity of the algorithm is analyzed. Lastly, by a computing example the modeling approach and constructing algorithm of dynamic workflow based on Petri-Net are proved to be practical, effective and feasible.
Bayesian confirmation theory considers a variety of non-equivalent confirmation measures which say in what degree a piece of evidence confirms a hypothesis. In this paper, we apply some well-known confirmation measure...
详细信息
Bayesian confirmation theory considers a variety of non-equivalent confirmation measures which say in what degree a piece of evidence confirms a hypothesis. In this paper, we apply some well-known confirmation measures within the rough set approach to discovering relationships in data in terms of decision rules. Moreover, we discuss some interesting properties of these confirmation measures and we propose a new property of monotonicity that is particularly relevant within rough set approach. The main result of this paper states that only two from among confirmation measures considered in the literature have the desirable properties from the viewpoint of the rough set approach. Moreover, we clarify relationships between logical implications and decision rules, and we compare the confirmation measures to several related measures, like independence (dependence) of logical formulas, interestingness measures in data mining and Bayesian solutions of raven's paradox. (C) 2004 Elsevier Ltd. All rights reserved.
In this paper, two classes of decidable structures are compared. The first class is the class of H-bounded structures, in which quantifiers can be bounded by some recursive function H. The second class is the class of...
详细信息
In this paper, two classes of decidable structures are compared. The first class is the class of H-bounded structures, in which quantifiers can be bounded by some recursive function H. The second class is the class of structures with recursive destinies, where destinies are finite organized trees embodying all Fraissean k-equivalence types of the structure. We show that H-bounded structures have recursive destinies, and we compare two decision algorithms in H-bounded structures: Ferrante-Rackoffs algorithm, which uses the function H and elimination of quantifiers, and Nezondet's algorithm, which precomputes destinies and evaluates sentences on these finite trees. We also prove that the inclusion between the two classes is strict, by exhibiting a structure with recursive destinies which is not H-bounded. Finally, we characterize the class of H-bounded structures as the class of structures with strongly recursive destinies, i.e. for which there exists an algorithm constructing the destinies of any tuple of elements. (C) 2004 Elsevier B.V. All rights reserved.
The problems associated with the use of combinatorial chemistry in lead generation and optimization are discussed. A post-synthesis data evaluation process is described which can cope with large data sets from paralle...
详细信息
A deterministic pushdown automaton (dpda) having just one stack symbol is called a deterministic restricted one-counter automaton (droca). A deterministic one-counter automaton (doca) is a dpda having only one stack s...
详细信息
A deterministic pushdown automaton (dpda) having just one stack symbol is called a deterministic restricted one-counter automaton (droca). A deterministic one-counter automaton (doca) is a dpda having only one stack symbol, with the exception of a bottom-of-stack marker. The class of languages accepted by droca's is a proper subclass of the class of languages accepted by doca's. Valiant has shown that the regularity problem for doca's is decidable in a single exponential worst-case time complexity. In this paper, we prove that the class of languages accepted by droca's which accept by final state is incomparable with the class of languages accepted by droca's which accept by empty stack (strict droca's), and that the intersection of them is equal to the class of strict regular languages. In addition, we present a new direct branching algorithm for checking the regularity for not only a strict droca but also a real-time droca which accepts by final state. Then we show that the worst-case time complexity of our algorithm is polynomial in the size of each droca.
A deterministic pushdown automaton (dpda) having just one stack symbol is called a deterministic restricted one-counter automaton (droca). A deterministic one-counter automaton (doca) is a dpda having only one stack s...
详细信息
A deterministic pushdown automaton (dpda) having just one stack symbol is called a deterministic restricted one-counter automaton (droca). A deterministic one-counter automaton (doca) is a dpda having only one stack symbol, with the exception of a bottom-of-stack marker. The class of languages accepted by droca's which accept by final state is a proper subclass of the class of languages accepted by doca's. Valiant has proved the decidability of the equivalence problem for doca's and the undecidability of the inclusion problem for doca's. Hence the decidability of the equivalence problem for droca's is obvious. In this paper, we evaluate the upper bound of the length df the shortest input string (witness) that disproves the inclusion for a pair of real-time droca's which accept by final state, and present a new direct branching algorithm for checking the inclusion for a pair of languages accepted by these droca's. Then we show that the worst-case time complexity of our algorithm is polynomial in the size of these droca's.
暂无评论