791 search results - page 62 / 159 » Approximating the Maximum Sharing Problem |
124
Voted
PVLDB
2008
15 years 2 months ago
2008
Due to the imperative need to reduce the management costs of large data centers, operators multiplex several concurrent database applications on a server farm connected to shared ...
135
Voted
INFOCOM
2011
IEEE
14 years 6 months ago
2011
IEEE
—We study the problem of throughput maximization in multi-hop wireless networks with end-to-end delay constraints for each session. This problem has received much attention start...
138
click to vote
UAI
1998
15 years 4 months ago
1998
This paper presents two new approaches to decomposing and solving large Markov decision problems (MDPs), a partial decoupling method and a complete decoupling method. In these app...
130
Voted
OPODIS
2010
15 years 20 days ago
2010
We explore asynchronous unison in the presence of systemic transient and permanent Byzantine faults in shared memory. We observe that the problem is not solvable under less than s...
125
Voted
AAAI
2010
15 years 4 months ago
2010
We consider approval voting elections in which each voter votes for a (possibly empty) set of candidates and the outcome consists of a set of k candidates for some parameter k, e....