681 search results - page 31 / 137 » General Polynomial Time Decomposition Algorithms |
117
click to vote
ICALP
2010
Springer
15 years 7 months ago
2010
Springer
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 ...
184
click to vote
PATAT
2004
Springer
15 years 8 months ago
2004
Springer
The timetabling problem consists in fixing a sequence of meetings between teachers and students in a prefixed period of time (typically a week), satisfying a set of constraints of ...
130
Voted
CAINE
2001
15 years 4 months ago
2001
In this paper, a new method for the approximation of discrete time state-affine systems is proposed. The method is based on the diagonalization of proposed generalized controllabi...
110
Voted
CORR
2006
Springer
15 years 2 months ago
2006
Springer
We study the problem of preemptive scheduling n jobs with given release times on m identical parallel machines. The objective is to minimize the average flow time. We show that wh...
124
Voted
CSCLP
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. The union-find algorithm can be seen as solving simple equations between variables or constants. With a few lines of code change, we generalise its implementation in CHR...