2095 search results - page 237 / 419 » Improved pebbling bounds |
194
click to vote
ESA
2009
Springer
16 years 1 months ago
2009
Springer
We study the performance of approximate Nash equilibria for congestion games with polynomial latency functions. We consider how much the price of anarchy worsens and how much the ...
187
click to vote
SARA
2009
Springer
16 years 1 months ago
2009
Springer
MINLP problems are hard constrained optimization problems, with nonlinear constraints and mixed discrete continuous variables. They can be solved using a Branch-and-Bound scheme c...
184
click to vote
TAMC
2009
Springer
2009
Springer
Linear Programming Based Approximation Algorithms for Feedback Set Problems in Bipartite Tournaments
16 years 1 months ago
We consider the feedback vertex set and feedback arc set problems in bipartite tournaments. We improve on recent results by giving a 2-approximation algorithm for the feedback vert...
166
click to vote
CDC
2008
IEEE
16 years 1 months ago
2008
IEEE
— It has been observed that adding a few long range edges to certain graph topologies can significantly increase the rate of convergence for consensus algorithms. A notable exam...
172
click to vote
GLOBECOM
2008
IEEE
16 years 1 months ago
2008
IEEE
— In this paper, distributed double-differential coding is proposed to avoid the problem of carrier offsets in amplify and forward protocol based cooperative network with two rel...