1480 search results - page 209 / 296 » Distributed algorithms for weighted problems in sparse graph... |
128
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Bargaining networks model the behavior of a set of players who need to reach pairwise agreements for making profits. Nash bargaining solutions in this context correspond to soluti...
104
Voted
SIGECOM
2006
ACM
15 years 7 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...
120
click to vote
IPPS
2009
IEEE
15 years 7 months ago
2009
IEEE
We are interested in this paper to study scheduling problems in systems where many users compete to perform their respective jobs on shared parallel resources. Each user has speci...
119
Voted
CORR
2008
Springer
15 years 1 months ago
2008
Springer
Abstract--Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typi...
133
Voted
PODC
2005
ACM
15 years 6 months ago
2005
ACM
We consider four problems on distance estimation and object location which share the common flavor of capturing global information via informative node labels: low-stretch routin...