467 search results - page 86 / 94 » The General Yard Allocation Problem |
BIRTHDAY
2006
Springer
13 years 10 months ago
2006
Springer
Consider a simple network flow problem in which there are n channels directed from a source to a sink. The channel capacities are unknown and we wish to determine a feasible netwo...
AAAI
2004
13 years 8 months ago
2004
Combinatorial auctions (CAs) are important mechanisms for allocating interrelated items. Unfortunately, winner determination is NP-complete unless there is special structure. We s...
SIGECOM
2008
ACM
13 years 6 months ago
2008
ACM
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
SECON
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract— While physical layer capture has been observed in real implementations of wireless devices which randomly accessing shared channels, fair rate control algorithms based ...
IWMM
2007
Springer
14 years 26 days ago
2007
Springer
This article presents a heap space analysis for (sequential) Java bytecode. The analysis generates heap space cost relations which define at compile-time the heap consumption of ...