In the weighted paging problem there is a weight (cost) for fetching each page into the cache. We design a randomized O(log k)-competitive online algorithm for the weighted paging...
— Although recent years provided many protocols for anonymous routing in overlay networks, they commonly rely on the same communication paradigm: Onion Routing. In Onion Routing ...
Olaf Landsiedel, Lexi Pimenidis, Klaus Wehrle, Hei...
— 1 Taking advantage of the independent fading channel conditions among multiple wireless users, opportunistic transmissions schedule the user with the instantaneously best condi...
Using multiple lenses of strategic choice theories (diffusion of innovation, organizational innovativeness) and institutional theory as the basis and reflecting data from semi-str...
Systems using Software Agents (or Multi-Agent Systems, MAS) are becoming more popular within the development mainstream because, as the name suggests, an Agent aims to handle task...
Chia-En Lin, Krishna M. Kavi, Frederick T. Sheldon...