1016 search results - page 186 / 204 » Optimized algorithms for multi-agent routing |
106
click to vote
WAOA
2005
Springer
15 years 3 months ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
91
Voted
JNW
2008
14 years 9 months ago
2008
Recently overlay networks have emerged as an efficient and flexible method for content distribution. An overlay network is a network running on top of another network, usually the ...
SPAA
2005
ACM
15 years 3 months ago
2005
ACM
We study the admission control problem in general networks. Communication requests arrive over time, and the online algorithm accepts or rejects each request while maintaining the...
MOBIHOC
2007
ACM
15 years 9 months ago
2007
ACM
Recently, there has been substantial interest in the design of crosslayer protocols for wireless networks. These protocols optimize certain performance metric(s) of interest (e.g....
PODC
2006
ACM
15 years 3 months ago
2006
ACM
A quorum system over a universe of logical elements is a collection of subsets (quorums) of elements, any two of which intersect. In numerous distributed algorithms, the elements ...