530 search results - page 49 / 106 » An Algorithm for Approximating the Satisfiability Problem of... |
DISOPT
2008
13 years 8 months ago
2008
We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...
ICCAD
2003
IEEE
14 years 1 months ago
2003
IEEE
This work presents a formal probabilistic approach for solving optimization problems in design automation. Prediction accuracy is very low especially at high levels of design flo...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
We prove strong lower bounds on integrality gaps of Sherali?Adams relaxations for MAX CUT, Vertex Cover, Sparsest Cut and other problems. Our constructions show gaps for Sherali?A...
NA
2008
13 years 7 months ago
2008
Another hybrid conjugate gradient algorithm is subject to analysis. The parameter k is computed as a convex combination of HS k (Hestenes-Stiefel) and DY k (Dai-Yuan) algorithms, i...
AI
2008
Springer
13 years 8 months ago
2008
Springer
In the arena of automated negotiations we focus on the principal negotiation protocol in bilateral settings, i.e. the alternatingoffers protocol. In the scientific community it is...