1662 search results - page 280 / 333 » The Computational Complexity of Agent Design Problems |
MOBIHOC
2008
ACM
14 years 8 months ago
2008
ACM
Recently, cooperative communications, in the form of keeping each node with a single antenna and having a node exploit a relay node's antenna, is shown to be a promising appr...
MOBICOM
2006
ACM
14 years 2 months ago
2006
ACM
In this paper, we consider the channel assignment problem in single radio multi-channel mobile ad-hoc networks. Specifically, we investigate the granularity of channel assignment...
SIGECOM
2005
ACM
14 years 2 months ago
2005
ACM
In this paper we formulate the fixed budget resource allocation game to understand the performance of a distributed marketbased resource allocation system. Multiple users decide ...
EUROPAR
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. This paper is devoted to scheduling a large collection of independent tasks onto a distributed heterogeneous platform, which is composed of a set of servers. Each server ...
ASIACRYPT
2000
Springer
14 years 1 months ago
2000
Springer
Abstract. Construction of secure hyperelliptic curves is of most important yet most difficult problem in design of cryptosystems based on the discrete logarithm problems on hyperel...