790 search results - page 66 / 158 » Subexponential Parameterized Algorithms |
150
click to vote
INFOCOM
2009
IEEE
15 years 9 months ago
2009
IEEE
Abstract— Sum rate maximization by power control is an important, challenging, and extensively studied problem in wireless networks. It is a nonconvex optimization problem and ac...
114
click to vote
FSTTCS
2000
Springer
15 years 6 months ago
2000
Springer
Abstract. This paper presents the first formal verification of the RicartAgrawala algorithm [RA81] for distributed mutual exclusion of an arbitrary number of nodes. It uses the Tem...
122
click to vote
EOR
2008
15 years 3 months ago
2008
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...
135
click to vote
SIGECOM
2003
ACM
15 years 8 months ago
2003
ACM
We prove the existence of -Nash equilibrium strategies with support logarithmic in the number of pure strategies. We also show that the payoffs to all players in any (exact) Nash...
138
click to vote
SG
2005
Springer
15 years 8 months ago
2005
Springer
Parametric design systems model a design as a constrained collection of schemata. Designers work in such systems at two levels: definition of schemata and constraints; and search w...