4315 search results - page 107 / 863 » Sorting in linear time |
ICCAD
2006
IEEE
14 years 5 months ago
2006
IEEE
— In this paper, we propose a timing model reduction algorithm for hierarchical timing analysis based on a bicliquestar replacement technique. In hierarchical timing analysis, ea...
MP
2006
13 years 9 months ago
2006
Although the general linear complementarity problem (LCP) is NP-complete, there are special classes that can be solved in polynomial time. One example is the type where the definin...
CORR
2006
Springer
13 years 9 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...
QUESTA
2007
13 years 8 months ago
2007
We consider an extension of the standard G/G/1 queue, described by the equation W D = max{0, B − A + Y W}, where P[Y = 1] = p and P[Y = −1] = 1 − p. For p = 1 this model red...
LFCS
1997
Springer
14 years 1 months ago
1997
Springer
The provability problem for the Horn fragment of linear logic is NP-complete [4, 1]. In this work we investigate various definitions of concurrency proposed in [2] and establish t...