2899 search results - page 435 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
186
click to vote
CORR
2011
Springer
15 years 12 days ago
2011
Springer
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...
149
click to vote
DAC
2006
ACM
16 years 6 months ago
2006
ACM
As the technology node advances into the nanometer era, via-open defects are one of the dominant failures. To improve via yield and reliability, redundant-via insertion is a highl...
182
click to vote
KDD
2003
ACM
16 years 5 months ago
2003
ACM
Models for the processes by which ideas and influence propagate through a social network have been studied in a number of domains, including the diffusion of medical and technolog...
154
click to vote
TC
2008
15 years 5 months ago
2008
Cryptanalysis of ciphers usually involves massive computations. The security parameters of cryptographic algorithms are commonly chosen so that attacks are infeasible with availabl...
127
click to vote
ICC
2007
IEEE
15 years 11 months ago
2007
IEEE
— Optimal bandwidth utilisation together with resilience and recovery from failure are two key drivers for Traffic Engineering (TE) which have been widely addressed by the IP co...