100 search results - page 7 / 20 » mp 2010 |
IWOMP
2010
Springer
15 years 1 months ago
2010
Springer
FORTE
2010
14 years 11 months ago
2010
Abstract. The complexity of distributed algorithms, such as state machine replication, motivates the use of formal methods to assist correctness verification. The design of the for...
MP
2010
14 years 8 months ago
2010
Convex optimization problems arising in applications, possibly as approximations of intractable problems, are often structured and large scale. When the data are noisy, it is of i...
103
click to vote
MP
2010
14 years 8 months ago
2010
The Lov´asz theta number of a graph G can be viewed as a semidefinite programming relaxation of the stability number of G. It has recently been shown that a copositive strengthe...
MP
2010
14 years 8 months ago
2010
Valid inequalities for 0-1 knapsack polytopes often prove useful when tackling hard 0-1 Linear Programming problems. To generate such inequalities, one needs separation algorithms...