1089 search results - page 206 / 218 » Bounds on generalized Frobenius numbers |
SIGECOM
2006
ACM
14 years 1 months ago
2006
ACM
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...
PODC
2005
ACM
14 years 1 months ago
2005
ACM
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
MMMACNS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. The recent proliferation of Internet worms has raised questions about defensive measures. To date most techniques proposed are passive, in-so-far as they attempt to block...
WAOA
2005
Springer
14 years 1 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...
WINE
2005
Springer
14 years 1 months ago
2005
Springer
We propose a simple and intuitive cost mechanism which assigns costs for the competitive usage of m resources by n selfish agents. Each agent has an individual demand; demands are...