2957 search results - page 70 / 592 » The Complexity of Polynomial-Time Approximation |
ADAEUROPE
2007
Springer
14 years 1 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...
CPM
2004
Springer
14 years 1 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...
FOCS
1992
IEEE
13 years 11 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...
ASPDAC
2008
ACM
13 years 9 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 ...
IPCO
2004
13 years 9 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...