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.
Spectrum auction has been considered as an economically incentive way to motivate both primary spectrum owners (POs) and secondary users (SUs) to participate in dynamic spectrum access (DSA). In this paper, we propose a new combinatorial spectrum auction framework for the scenarios that each PO has multiple channels to sell and each SU demands multiple channels. Moreover, the heterogeneity in terms...
Equivalent bandwidth (EqB) is defined as the minimum service rate to be provided to a traffic buffer to guarantee a certain degree of quality of service (QoS) in terms of objective parameters (packet loss, delay, jitter). EqB techniques are usually obtained analytically for homogeneous traffic trunks, with respect to a single QoS constraint. Modern network solutions often imply the aggregation of...
The average height of a binary tree With n internal nodes is shown to be asymptotic to 2√πn. More generally, the average height of a tree in a simple family S with n nodes is asymptotic to c(S) √πn where c(S) is a number (usually algebraic) which can be explicitly determined from S. These results are achieved by means of a detailed singularity analysis of corresponding generating functions.
A combinatorial problem related to storage allocation is analyzed. The problem falls into a class of NP-complete, one-dimensional bin-packing problems. We propose an iterative approximation algorithm and show that it is superior to an earlier heuristic presented for this problem. The bulk of the paper is devoted to the proof of a worst-case performance bound.
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.