This site uses cookies to deliver our services and to ensure you get the best experience. By continuing to use this site, you consent to our use of cookies and acknowledge that you have read and understand our Privacy Policy, Cookie Policy, and Terms
In this paper we address the problem of finding an object in a polygonal environment as quickly as possible on average, with a team of mobile robots that can sense the environment...
Alejandro Sarmiento, Rafael Murrieta-Cid, Seth Hut...
A number of solutions have been proposed to address the free-riding problem in peer-to-peer file sharing systems. The solutions are either imperfect–they allow some users to ch...
This paper deals with a new pricing approach in utility fair networks, where the user’s application is associated with a utility function. We allow users to have concave as well...
— In this paper, a scheduling problem is considered in the cellular network where there exist CBR (constant bit rate) users requiring exact minimum average throughput and delay g...
— For most of wireless services with variable rate transmission, both average rate and rate oscillation are important performance metrics. One often needs to decide how much rate...
— We consider the problem of rate allocation in a fading Gaussian multiple-access channel with fixed transmission powers. The goal is to maximize a general concave utility funct...