3267 search results - page 607 / 654 » Generalized quasirandom graphs |
STOC
2009
ACM
15 years 11 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...
115
click to vote
STOC
2009
ACM
15 years 11 months ago
2009
ACM
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
PPOPP
2009
ACM
15 years 11 months ago
2009
ACM
Load balancing is a technique which allows efficient parallelization of irregular workloads, and a key component of many applications and parallelizing runtimes. Work-stealing is ...
SPAA
2009
ACM
15 years 11 months ago
2009
ACM
Dining philosophers is a classic scheduling problem for local mutual exclusion on arbitrary conflict graphs. We establish necessary conditions to solve wait-free dining under even...
124
click to vote
KDD
2009
ACM
15 years 11 months ago
2009
ACM
A recent study by two prominent finance researchers, Fama and French, introduces a new framework for studying risk vs. return: the migration of stocks across size-value portfolio ...