2446 search results - page 410 / 490 » Choiceless Polynomial Time |
ATMOS
2009
13 years 8 months ago
2009
Trains often arrive delayed at stations where passengers have to change to other trains. The question of delay management is whether these trains should wait for the original train...
ESA
2010
Springer
13 years 8 months ago
2010
Springer
We study a wide generalization of two classical problems, the Huffman Tree and Alphabetic Tree Problem. We assume that the cost caused by the ith leaf is fi(di), where di is its d...
EUROPAR
2010
Springer
13 years 8 months ago
2010
Springer
We present in this article a new approximation algorithm for scheduling a set of n independent rigid (meaning requiring a fixed number of processors) jobs on hierarchical parallel ...
ALGORITHMICA
2007
13 years 7 months ago
2007
Abstract Many compiler optimization techniques depend on the ability to calculate the number of elements that satisfy certain conditions. If these conditions can be represented by ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We consider the problem of designing truthful auctions, when the bidders' valuations have a public and a private component. In particular, we consider combinatorial auctions w...