562 search results - page 80 / 113 » Approximation algorithms and hardness of the k-route cut pro... |
ESA
2010
Springer
14 years 10 months ago
2010
Springer
In a Content Distribution Network application, we have a set of servers and a set of clients to be connected to the servers. Often there are a few server types and a hard budget co...
81
Voted
SPAA
2006
ACM
15 years 3 months ago
2006
ACM
Consider a network in which a collection of source nodes maintain and periodically update data objects for a collection of sink nodes, each of which periodically accesses the data...
ATAL
2009
Springer
15 years 4 months ago
2009
Springer
This paper reports on a novel decentralised technique for planning agent schedules in dynamic task allocation problems. Specifically, we use a Markov game formulation of these pr...
122
click to vote
CVPR
2009
IEEE
15 years 8 months ago
2009
IEEE
Many vision problems have been formulated as en- ergy minimization problems and there have been signif- icant advances in energy minimization algorithms. The most widely-used energ...
66
Voted
STOC
2004
ACM
15 years 10 months ago
2004
ACM
A flow is said to be confluent if at any node all the flow leaves along a single edge. Given a directed graph G with k sinks and non-negative demands on all the nodes of G, we con...