The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
K-means is a widely used clustering algorithm in field of data mining across different disciplines in the past fifty years. However, k-means heavily depends on the position of initial centers, and the chosen starting centers randomly may lead to poor quality of clustering. Motivated by this, this paper proposes an optimized k-means clustering method along with three optimization principles named k*-means...
For millimeter-wave (MMW) communications, the in-phase quadrature imbalance (IQI) at the transmitter (TX) and the receiver (RX) may severely degrade the system performance, if not compensated. This paper addresses the joint estimation and compensation of TX and RX IQIs for single carrier frequency domain equalization (SC-FDE) systems. In particular, we introduce a concept called channel variation...
In multi agent system, how to find a coalition structure making the greatest profits in cooperation in the shortest time is an issue which has been given much attention. When finding the optimal coalition structure, if we make no any restriction on the searching space, we must search all the coalition structures. An anytime algorithm-LVAA(Lateral and Vertical Anytime Algorithm), designed in this paper,...
CP-Nets: CP-nets (Condition Preference Nets) is a tool for representing and reasoning with condition ceteris paribus preference statements put forward by Craig Boutilier, but how to represent and realize is not given. In this paper, after introducing some notions and an example of CP-nets, we adopt binary list as a storage structure to represent and store CPTs, and devise an algorithm for ranking...
This paper concerns training computational thinking in discrete mathematics teaching. Firstly, four main components of computational thinking are given, which are abstract thinking, logical thinking, modeling thinking and constructive thinking. Secondly, some content of discrete mathematics, which have close relationship with computational thinking, are described by corresponding application example...
CP-nets (Condition Preference Nets) is a tool for representing and reasoning with condition ceteris paribus preference statements put forward by Craig Boutilier[1], but how to represent and realize is not given. In this paper, after some notions and an example of CP-nets, we mainly introduce the realization for the class of binary-valued, tree-structured CP-nets, which is conducted on the basis of...
Parallel finite automata is an extended finite status machine and it is suitable for characterizing of concurrent and synchronization task. Based on the workflow modeling, this paper defines some concepts of PFA and describes table and diagram representation of node transition function and state transition function which are the main components of FPA. The former expresses static structure of PFA,...
This paper is concerned with optimal coalition structure generation in multi-agent systems. For characteristic function game representations, we propose a branch and bound technique presented in the form of possible bipartite partitions and upper bound of coalition structure value, these techniques can be incorporated into many potential coalition structure generation algorithms. In order to test...
Agent organization is a set of agents to solve a problem together, it describes the relationship between agents and roles which agents taking. Firstly, this paper proposes the concept of stable matching in role assigning, and constitutes all the stable matching into a set F, then describes its properties. Secondly, considering the preference of role and agent, we construct a strong stable relations,...
In the field of multi-agent systems, the coalition structure generation problem is extremely challenging due to the exponential number of partitions that need to be examined. What kind of appearance the space of coalition structure is, there is few man to research it. This paper take the space of coalition structure as a coalition structure graph, give four properties of OCS (optimal coalition structure)...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.