96 search results - page 11 / 20 » Approximating the maximum quadratic assignment problem |
COCO
2006
Springer
14 years 9 days ago
2006
Springer
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
IWCMC
2006
ACM
14 years 2 months ago
2006
ACM
Designing and planning of the switching, signaling and support network is a fairly complex process in cellular mobile network. In this paper, the problem of assigning cells to swi...
INFOCOM
2003
IEEE
14 years 1 months ago
2003
IEEE
— In all-optical networks that use WDM technology it is often the case that several communication requests have to be blocked, due to bandwidth and technology limitations. Minimi...
CVPR
2009
IEEE
15 years 3 months ago
2009
IEEE
Many problems in computer vision can be modeled using
conditional Markov random fields (CRF). Since finding
the maximum a posteriori (MAP) solution in such models
is NP-hard, mu...
JCO
2011
13 years 3 months ago
2011
Discrete gate sizing is a critical optimization in VLSI circuit design. Given a set of available gate sizes, discrete gate sizing problem asks to assign a size to each gate such th...