Search Results

Digital information economies require information goods producers to learn how to position themselves within a potentially vast product space. Further, the topography of this space is often nonstationary, due to the ...

In this paper we investigate the expected lifetime and information capacity , defined as the maximum amount of data (bits) transferred before the first sensor node death due to energy depletion, of a data-gathering wireless ...

We present an approach to the admission control and resource allocation problem in connection-oriented networks that offer multiple services to users. Users' preferences are summarized by means of their utility functions, ...

Disk space in shared Web caches can be diverted to serve some system users at the expense of others. Cache hits reduce server loads, and if servers desire load reduction to different degrees, a replacement policy which ...

In an economy in which a producer must learn the preferences of a consumer population, it is faced with a classic decision problem: when to explore and when to exploit. If the producer has a limited number of chances to ...

This paper compares five different schemes – called CHOI, NAG, AG, BHARG, and NCBF – for reserving bandwidths for handoffs and admission control for new connection requests in QoS‐sensitive cellular networks. CHOI and NAG ...

Markets for digital information goods provide the possibility of exploring new and more complex pricing schemes, due to information goods' flexibility and negligible marginal cost. In this paper we compare the dynamic ...

Statistics are obtained for pulse trains in which the pulse shapes as well as the time base are random. The general expression derived for the mean and spectral density of the pulse train require neither independence of ...

Computer job scheduling is often performed with little understanding of the formal properties of the jobs being scheduled. One reason for this is that optimal solutions for job scheduling on computers are difficult to ...