409 search results - page 59 / 82 » Polynomial Time Approximation Schemes and Parameterized Comp... |
146
click to vote
SODA
2008
ACM
15 years 6 months ago
2008
ACM
We analyze several distributed, continuous time protocols for a fair allocation of bandwidths to flows in a network (or resources to agents). Our protocols converge to an allocati...
169
click to vote
FUIN
2006
15 years 4 months ago
2006
This paper introduces an approach to behavioral pattern identification as a part of a study of temporal patterns in complex dynamical systems. Rough set theory introduced by Zdzisl...
153
Voted
GLVLSI
2010
IEEE
15 years 5 months ago
2010
IEEE
We revisit voltage partitioning problem when the mapped voltages of functional units are predetermined. If energy consumption is estimated by formulation E = CV 2 , a published wo...
155
click to vote
LATIN
2010
Springer
15 years 3 months ago
2010
Springer
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
136
Voted
ESA
2003
Springer
15 years 10 months ago
2003
Springer
In ad-hoc wireless networks, certain network connectivity constraints are of interest because of their practical importance. An example of such a constraint would be strong connec...