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.
ID3 is a classical algorithm of decision tree of classification with fast speed and easily understandable classification results. ID3 based on information gain tend to select test attribute with a variety of values, thus unable to deal with continuous attributes. In order to solve the above problems, this paper introduces the support in rough sets to discretize the continuous attributes dynamically,...
In 1993, Jackson and Wormald conjectured that if G is a 3-connected n-vertex graph with maximum degree d≥ 4 then G contains a cycle of length $\Omega(n^{\log_{d-1}2})$ , and showed that this bound is best possible if true. In this paper we present an O(n3) algorithm for finding a cycle of length $\Omega(n^{\log_{b}2})$ in G, where b = max {64,4d + 1}. Our result substantially...
In this paper, we study path selection and power allocation problems for relay-aided systems with multiple source, relay, and destination nodes. To take fairness among different links into account, we aim at maximizing the minimum source-relay-destination link rate performance. We consider the scenario that the source node can be paired with any destination node. For this scenario, we decouple the...
In this paper, we investigate robust resource allocation for cognitive radio networks. First, a resource allocation scheme based on stable matching is developed, which takes the preferences of both secondary users and primary users into account. To improve its robustness, we then discuss an ∊-stable resource allocation scheme. With the help of the properties of ∊-stable resource allocation, three...
In this paper, we investigate resource allocation for underlay cognitive radio (CR) networks, where the CR users coexist but do not cause unacceptable interference with licensed users. We focus on the energy efficiency (EE) performance of the system, where both throughput and energy consumption will be considered. We first formulate a sum-EE maximization problem and solve it by the Hungarian algorithm,...
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.