Micah Adler

TL;DR: In this article, a system and method for scheduling and controlling delivery of advertising in a communications network and a communication network and remote computer program employing the system or the method is presented, which includes: (1) a time allocation controller that allocates time available in a particular advertising region in a display device of a remote computer between at least two advertisements as a function of one of a desired user frequency, a desired time frequency, or a desired geometry, for each of the advertisements and (2) data communication controller, coupled to the time allocation Controller, that delivers the at least

TL;DR: The performance of the algorithms on graphs generated by the random graph models suggests that by taking advantage of the link structure of the Web, one may achieve significantly better compression than natural Huffman-based schemes.

TL;DR: The problem of centrally scheduling multiple messages in a linear network, when each message has both a release time and a deadline is studied, and it is shown that buffering can improve throughput in general by a logarithmic factor, but that in several significant special cases, Buffering can help by only a small constant factor.

TL;DR: A simple algorithm is introduced, where it is sufficient for each job to choose between 2 random servers, that obtains the following result: if m ≤ n/6e, then for any given round, the probability that any job has to wait more than O(log log n) rounds before being processed is at most 1/nα for any constant α.

TL;DR: This paper model and analyze the performance of so-called power-controlled ad hoc wireless networks: networks where the mobile hosts are able to change their transmission power, and demonstrates that if the authors restrict ourselves to the important case of routing between nodes distributed randomly in a Euclidean space, they can route in a time that is asymptotically optimal for any routing scheme.