2957 search results - page 70 / 592 » The Complexity of Polynomial-Time Approximation |
137
click to vote
ADAEUROPE
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. In this paper we present algorithms to statically detect livelocks in Ada multitasking programs. Although the algorithms’ worst-case execution time is exponential, they...
220
click to vote
CPM
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. This paper addresses the problem of aligning multiple sequences of non-coding RNA genes. We approach this problem with the biologically motivated paradigm that scoring of...
105
click to vote
FOCS
1992
IEEE
15 years 7 months ago
1992
IEEE
We give a new characterization of NP: the class NP contains exactly those languages L for which membership proofs (a proof that an input x is in L) can be verified probabilisticall...
129
click to vote
ASPDAC
2008
ACM
15 years 5 months ago
2008
ACM
Abstract-- We address performance maximization of independent task sets under energy constraint on chip multi-processor (CMP) architectures that support multiple voltage/frequency ...
142
click to vote
IPCO
2004
15 years 4 months ago
2004
We consider the problem of minimizing the weighted sum of job completion times on a single machine (subject to certain job weights) with an additional side constraint on the weigh...