3049 search results - page 371 / 610 » On the Convergence of Bound Optimization Algorithms |
147
Voted
JCO
2006
15 years 6 months ago
2006
Consider the problem of partitioning n nonnegative numbers into p parts, where part i can be assigned ni numbers with ni lying in a given range. The goal is to maximize a Schur con...
168
click to vote
INFOCOM
2010
IEEE
15 years 5 months ago
2010
IEEE
—Linear network coding is a promising technology that can maximize the throughput capacity of communication network. Despite this salient feature, there are still many challenges...
181
click to vote
DAC
2012
ACM
13 years 9 months ago
2012
ACM
In this work we address the problem of managing interconnect timing in high-level synthesis by generating a layoutfriendly microarchitecture. A metric called spreading score is pr...
171
click to vote
RTAS
2005
IEEE
16 years 6 days ago
2005
IEEE
The increasing popularity of high-volume performancecritical Internet applications calls for a scalable server design that allows meeting individual response-time guarantees. Cons...
168
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
The lift-and-project closure is the relaxation obtained by computing all lift-and-project cuts from the initial formulation of a mixed integer linear program or equivalently by co...