14548 search results - page 2482 / 2910 » The Optimal Path-Matching Problem |
177
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
We consider the problem of MaxMin allocation of indivisible goods. There are m items to be distributed among n players. Each player i has a nonnegative valuation pij for an item j...
181
click to vote
SPAA
2009
ACM
16 years 7 months ago
2009
ACM
Modern peer-to-peer file sharing systems distribute large files among peers using block partitioning. Blocks can be redistributed by a peer even before the whole file is available...
276
click to vote
SIGMOD
2009
ACM
16 years 7 months ago
2009
ACM
In the rank join problem we are given a relational join R1 1 R2 and a function that assigns numeric scores to the join tuples, and the goal is to return the tuples with the highes...
208
click to vote
PODS
2007
ACM
16 years 7 months ago
2007
ACM
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
199
click to vote
SOSP
2009
ACM
16 years 3 months ago
2009
ACM
This paper addresses the problem of scheduling concurrent jobs on clusters where application data is stored on the computing nodes. This setting, in which scheduling computations ...