30 search results - page 5 / 6 » Budgeted Allocations in the Full-Information Setting |
117
click to vote
ISM
2008
IEEE
15 years 8 months ago
2008
IEEE
We present a set of techniques to simplify tree models for faster rendering while retaining their visual resemblance to the original model. This goal is achieved by setting a budg...
117
click to vote
ISTCS
1997
Springer
15 years 6 months ago
1997
Springer
We introduce the k-payment problem: given a total budget of N units, the problem is to represent this budget as a set of coins, so that any k exact payments of total value at most ...
105
click to vote
COLT
2008
Springer
15 years 3 months ago
2008
Springer
We analyze a sequential game between a Gambler and a Casino. The Gambler allocates bets from a limited budget over a fixed menu of gambling events that are offered at equal time i...
111
click to vote
SIGECOM
2009
ACM
15 years 8 months ago
2009
ACM
We study the problem of how to allocate m identical items among n > m agents, assuming each agent desires exactly one item and has a private value for consuming the item. We as...
ICCAD
2004
IEEE
15 years 10 months ago
2004
IEEE
This paper presents the Routing Cost Valleys (RCV) algorithm – the first published algorithm that simultaneously optimizes all short- and long-path timing constraints in a Field...