2252 search results - page 269 / 451 » Lower Bounds for Dynamic Algorithms |
143
click to vote
ESA
2009
Springer
15 years 10 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 ...
118
Voted
FOCS
2006
IEEE
15 years 9 months ago
2006
IEEE
We investigate the optimality of (1+ )-approximation algorithms obtained via the dimensionality reduction method. We show that: • Any data structure for the (1 + )-approximate n...
107
Voted
ISPD
2006
ACM
15 years 9 months ago
2006
ACM
In this invited note we outline several algorithms and features appearing in Capo 10, free open-source software for congestion-driven standard cell placement, mixed-size placement...
134
Voted
COCOON
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. The infrastructure for mobile distributed tasks is often formed by cellular networks. One of the major issues in such networks is interference. In this paper we tackle in...
126
Voted
ICTCS
2005
Springer
15 years 9 months ago
2005
Springer
We study the effect of laxity, or slack time, on the online scheduling of broadcasts with deadlines. The laxity of a request is defined to be the ratio between its span (differe...