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.
The general adversary bound is a semi-definite program (SDP) that lower-bounds the quantum query complexity of a function. We turn this lower bound into an upper bound, by giving a quantum walk algorithm based on the dual SDP that has query complexity at most the general adversary bound, up to a logarithmic factor. In more detail, the proof has two steps, each based on "span programs," a...
In this paper, we study the scheduling of off-line subjective tests for evaluating alternative parameter values of control schemes in real-time multimedia applications. These applications are characterized by multiple counteracting objective quality metrics (such as delay and signal quality) that can be affected by the control schemes. However, the tradeoffs among these metrics with respect to the...
The decentralized receding horizon control (DRHC) of a team of cooperative vehicles with limited communication bandwidth is considered. It is well known that the more communication the better stability and performance properties of the cooperative vehicles; however, in reality the available communication is often limited. This motivates our research to develop a new algorithm for efficient usage of...
A new algorithm is proposed for decentralized receding horizon control (DRHC) of multiple cooperative vehicles with limited communication bandwidth. The proposed algorithm uses a communication bandwidth allocation approach to optimize the teaming behavior. With the presented DRHC framework each vehicle uses a model of its neighboring vehicles to predict their future intention. The results from stability...
We consider the decentralized receding horizon control (DRHC) of a team of cooperative vehicles with limited communication bandwidth. The results of analyzing the feasibility, stability and performance of DRHC imply that the mismatch between predicted and actual plans of each agent plays an important role in stability and performance of the entire fleet. Hence, based on this key result, a new improved...
In this paper, we propose four methods for equalizing the silence periods experienced by users in a multi-party VoIP conversation in order to improve their perceived conversational quality. To mitigate the unbalanced silence periods caused by delay disparities in Internet connections, the playout scheduler at the receiver of each client equalizes the silence periods experienced. Our limited subjective...
The difficulty for accurate determination of the angles of arrival (AOA) of signals arises from the optimization of likelihood functions of high dimension. Usually, a gradient-based technique is employed to find the optimum of the function. However, this method requires heavy computational work and the differentiability of the likelihood function. This paper presents two gradient-free methods: One...
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.