608 search results - page 9 / 122 » On Dependent Randomized Rounding Algorithms |
COCO
2007
Springer
14 years 1 months ago
2007
Springer
We study semidefinite programming relaxations of Vertex Cover arising from repeated applications of the LS+ “lift-and-project” method of Lovasz and Schrijver starting from th...
CODES
2007
IEEE
14 years 1 months ago
2007
IEEE
Round-Robin scheduling is the most popular time triggered scheduling policy, and has been widely used in communication networks for the last decades. It is an efficient schedulin...
IPPS
2000
IEEE
13 years 12 months ago
2000
IEEE
In this paper we develop a variant of a previously proposed method the regenerative randomization method for the transient analysis of dependability performability models. The va...
PODC
2009
ACM
14 years 8 months ago
2009
ACM
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
DAM
2008
13 years 7 months ago
2008
We investigate the Semidefinite Programming based Sums of squares (SOS) decomposition method, designed for global optimization of polynomials, in the context of the (Maximum) Sati...