2976 search results - page 143 / 596 » On the bounded integer programming |
130
click to vote
IWMM
2009
Springer
15 years 9 months ago
2009
Springer
This paper presents an analysis that derives a formula describing the worst-case live heap space usage of programs in a functional language with automated memory management (garba...
MP
2010
15 years 1 months ago
2010
Adding cuts based on copositive matrices, we propose to improve Lov´asz’ bound θ on the clique number and its tightening θ introduced by McEliece, Rodemich, Rumsey, and Schri...
134
click to vote
DCOSS
2011
Springer
14 years 2 months ago
2011
Springer
—Sensor networks are often redundant by design; this is often done in order to achieve reliability in information processing. In many cases, the redundancy relationships between ...
114
click to vote
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
This paper addresses the optimization of upper and lower bounds on the capacity of the multiple-input multiple-output (MIMO) relay channel. In particular, we show that evaluating ...
131
click to vote
PLDI
1998
ACM
15 years 7 months ago
1998
ACM
We present a type-based approach to eliminating array bound checking and list tag checking by conservatively extending Standard ML with a restricted form of dependent types. This ...