Given a positive integer n and a positive semidefinite matrix A = (Aij ) ∈ Rm×m the positive semidefinite Grothendieck problem with rank-nconstraint is (SDPn) maximize mX i=1 ...
Abstract. The application field of static analysis techniques for objectoriented programming is getting broader, ranging from compiler optimizations to security issues. This leads...
Isabelle Pollet, Baudouin Le Charlier, Agostino Co...
In contrast to classical offline k-k routing, the online packet routing problem allows for an arbitrary number of packets with arbitrary end points and release times. We study this...
This paper describes Rthreads (Remote threads), a software distributed shared memory system that supports sharing of global variables on clusters of computers with physically dist...
Database applications such as online transaction processing (OLTP) and decision support systems (DSS) constitute the largest and fastest-growing segment of the market for multipro...