43264 search results - page 8463 / 8653 » Comparing models of computation |
175
click to vote
SIGECOM
2004
ACM
15 years 12 months ago
2004
ACM
We study a limited-supply online auction problem, in which an auctioneer has k goods to sell and bidders arrive and depart dynamically. We suppose that agent valuations are drawn ...
186
click to vote
SPAA
2004
ACM
15 years 12 months ago
2004
ACM
In this paper, we examine the problem of large-volume data dissemination via overlay networks. A natural way to maximize the throughput of an overlay multicast session is to split...
188
click to vote
SPAA
2004
ACM
15 years 12 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
171
click to vote
VRML
2004
ACM
15 years 12 months ago
2004
ACM
In this paper we present a VRML97-X3D extension to describe precomputed visibility relationships in the context of progressive transmission as well as real time visualization of m...
204
click to vote
ADHOCNOW
2004
Springer
15 years 11 months ago
2004
Springer
Consider k particles, 1 red and k −1 white, chasing each other on the nodes of a graph G. If the red one catches one of the white, it “infects” it with its color. The newly ...