604 search results - page 69 / 121 » On the Complexity of the Maximum Cut Problem |
195
click to vote
CORR
2011
Springer
15 years 25 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...
166
Voted
SIAMCOMP
1998
15 years 5 months ago
1998
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
159
click to vote
ECCV
2004
Springer
16 years 7 months ago
2004
Springer
Level-set methods have been shown to be an effective way to solve optimisation problems that involve closed curves. They are well known for their capacity to deal with flexible top...
131
click to vote
ICDCS
2008
IEEE
16 years 8 days ago
2008
IEEE
Declustering techniques reduce query response times through parallel I/O by distributing data among multiple devices. Recently, replication based approaches were proposed to furth...
150
click to vote
IPPS
1999
IEEE
15 years 10 months ago
1999
IEEE
In order for parallel logic programming systems to become popular, they should serve the broadest range of applications. To achieve this goal, designers of parallel logic programm...