1552 search results - page 254 / 311 » On the Complexity of Constant Propagation |
146
click to vote
ICEIS
2009
IEEE
14 years 9 months ago
2009
IEEE
Rearchitecturing large software systems becomes more and more complex after years of development and a growing size of the code base. Nonetheless, a constant adaptation of software...
100
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
—The problem of stabilizing an unstable plant over a noisy communication link is an increasingly important one that arises in problems of distributed control and networked contro...
CORR
2010
Springer
14 years 6 months ago
2010
Springer
Combinational or Classical logic circuits dissipate heat for every bit of information that is lost. Information is lost when the input vector cannot be recovered from its correspon...
CORR
2010
Springer
14 years 6 months ago
2010
Springer
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
TIT
2011
14 years 6 months ago
2011
Abstract—This work addresses the computational complexity of achieving the capacity of a general network coding instance. We focus on the linear capacity, namely the capacity of ...