7796 search results - page 1203 / 1560 » On Generalized Schur Numbers |
199
click to vote
STOC
2006
ACM
16 years 7 months ago
2006
ACM
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
228
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
224
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
We consider several classical models in deterministic inventory theory: the single-item lot-sizing problem, the joint replenishment problem, and the multi-stage assembly problem. ...
294
click to vote
SIGMOD
2009
ACM
16 years 7 months ago
2009
ACM
While there seems to be a general agreement that next years' systems will include many processing cores, it is often overlooked that these systems will also include an increa...
323
click to vote
SIGMOD
2008
ACM
16 years 7 months ago
2008
ACM
Mobile devices equipped with positioning capabilities (e.g., GPS) can ask location-dependent queries to Location Based Services (LBS). To protect privacy, the user location must n...