2694 search results - page 523 / 539 » Fully Distributed Algorithms for Convex Optimization Problem... |
SPAA
1993
ACM
15 years 1 months ago
1993
ACM
In this paper we introduce the ConSet communication model for distributed memory parallel computers. The communication needs of an application program can be satisfied by some ar...
85
Voted
ICC
2009
IEEE
15 years 4 months ago
2009
IEEE
— In this paper, we propose a game theoretical approach to tackle the problem of the distributed formation of the uplink tree structure among the relay stations (RSs) and their s...
MST
2000
14 years 9 months ago
2000
We consider the problem of processing a given number of tasks on a given number of processors as quickly as possible when only vague information about the processing time of a task...
CORR
2011
Springer
14 years 4 months ago
2011
Springer
We determine the robust Nash equilibrium (RNE) for a wide range of problems in communications systems and networks that are faced with uncertainty in their parameters’ values. T...
STOC
2004
ACM
15 years 10 months ago
2004
ACM
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...